mlpack →
4.3.0-2 →
armhf → 2024-01-16 09:36:56
sbuild (Debian sbuild) 0.85.0 (04 January 2023) on test2023
+==============================================================================+
| mlpack 4.3.0-2 (armhf) Tue, 16 Jan 2024 06:51:56 +0000 |
+==============================================================================+
Package: mlpack
Version: 4.3.0-2
Source Version: 4.3.0-2
Distribution: trixie-staging
Machine Architecture: arm64
Host Architecture: armhf
Build Architecture: armhf
Build Type: any
I: NOTICE: Log filtering will replace 'var/run/schroot/mount/trixie-staging-armhf-sbuild-b8df786b-973b-4d43-8bc9-8fc5a3465d34' with '<<CHROOT>>'
I: NOTICE: Log filtering will replace 'build/mlpack-xqM4jz/resolver-Mltzcr' with '<<RESOLVERDIR>>'
+------------------------------------------------------------------------------+
| Update chroot |
+------------------------------------------------------------------------------+
Get:1 http://172.17.4.1/private trixie-staging InRelease [11.3 kB]
Get:2 http://172.17.4.1/private trixie-staging/main Sources [14.4 MB]
Get:3 http://172.17.4.1/private trixie-staging/main armhf Packages [15.0 MB]
Fetched 29.4 MB in 5s (5570 kB/s)
Reading package lists...
W: http://172.17.4.1/private/dists/trixie-staging/InRelease: Key is stored in legacy trusted.gpg keyring (/etc/apt/trusted.gpg), see the DEPRECATION section in apt-key(8) for details.
+------------------------------------------------------------------------------+
| Fetch source files |
+------------------------------------------------------------------------------+
Check APT
---------
Checking available source versions...
Download source files with APT
------------------------------
Reading package lists...
NOTICE: 'mlpack' packaging is maintained in the 'Git' version control system at:
https://salsa.debian.org/science-team/mlpack.git
Please use:
git clone https://salsa.debian.org/science-team/mlpack.git
to retrieve the latest (possibly unreleased) updates to the package.
Need to get 4971 kB of source archives.
Get:1 http://172.17.4.1/private trixie-staging/main mlpack 4.3.0-2 (dsc) [2354 B]
Get:2 http://172.17.4.1/private trixie-staging/main mlpack 4.3.0-2 (tar) [4957 kB]
Get:3 http://172.17.4.1/private trixie-staging/main mlpack 4.3.0-2 (diff) [11.3 kB]
Fetched 4971 kB in 1s (7680 kB/s)
Download complete and in download only mode
I: NOTICE: Log filtering will replace 'build/mlpack-xqM4jz/mlpack-4.3.0' with '<<PKGBUILDDIR>>'
I: NOTICE: Log filtering will replace 'build/mlpack-xqM4jz' with '<<BUILDDIR>>'
+------------------------------------------------------------------------------+
| Install package build dependencies |
+------------------------------------------------------------------------------+
Setup apt archive
-----------------
Merged Build-Depends: cmake, debhelper-compat (= 13), pkg-config, libcereal-dev, libxml2-dev, libarmadillo-dev, libensmallen-dev (>= 2.10.0), libstb-dev, dh-python, dh-sequence-python3, python3, python3-dev, python3-pandas, python3-numpy, cython3, python3-setuptools, python3-pytest-runner, python3-pip, txt2man, build-essential, fakeroot
Filtered Build-Depends: cmake, debhelper-compat (= 13), pkg-config, libcereal-dev, libxml2-dev, libarmadillo-dev, libensmallen-dev (>= 2.10.0), libstb-dev, dh-python, dh-sequence-python3, python3, python3-dev, python3-pandas, python3-numpy, cython3, python3-setuptools, python3-pytest-runner, python3-pip, txt2man, build-essential, fakeroot
dpkg-deb: building package 'sbuild-build-depends-main-dummy' in '/<<RESOLVERDIR>>/apt_archive/sbuild-build-depends-main-dummy.deb'.
Ign:1 copy:/<<RESOLVERDIR>>/apt_archive ./ InRelease
Get:2 copy:/<<RESOLVERDIR>>/apt_archive ./ Release [609 B]
Ign:3 copy:/<<RESOLVERDIR>>/apt_archive ./ Release.gpg
Get:4 copy:/<<RESOLVERDIR>>/apt_archive ./ Sources [883 B]
Get:5 copy:/<<RESOLVERDIR>>/apt_archive ./ Packages [915 B]
Fetched 2407 B in 0s (0 B/s)
Reading package lists...
Reading package lists...
Install main build dependencies (apt-based resolver)
----------------------------------------------------
Installing build dependencies
Reading package lists...
Building dependency tree...
Reading state information...
The following additional packages will be installed:
autoconf automake autopoint autotools-dev bsdextrautils bsdutils
ca-certificates cmake cmake-data cpp-13 cython3 debhelper dh-autoreconf
dh-python dh-strip-nondeterminism dwz file g++-13 gawk gcc-13 gcc-13-base
gettext gettext-base groff-base hdf5-helpers icu-devtools intltool-debian
libaec-dev libaec0 libarchive-zip-perl libarchive13 libarmadillo-dev
libarmadillo12 libarpack2 libarpack2-dev libasan8 libatomic1 libblas-dev
libblas3 libblkid1 libbrotli1 libcc1-0 libcereal-dev libcurl4
libcurl4-openssl-dev libdebhelper-perl libelf1 libensmallen-dev libexpat1
libexpat1-dev libfile-stripnondeterminism-perl libgcc-13-dev libgcc-s1
libgfortran5 libgomp1 libhdf5-103-1 libhdf5-cpp-103-1 libhdf5-dev
libhdf5-fortran-102 libhdf5-hl-100 libhdf5-hl-cpp-100 libhdf5-hl-fortran-100
libicu-dev libicu72 libjpeg-dev libjpeg62-turbo libjpeg62-turbo-dev
libjs-jquery libjs-sphinxdoc libjs-underscore libjsoncpp25 liblapack-dev
liblapack3 libmagic-mgc libmagic1 libmount1 libnghttp2-14 libpipeline1
libpkgconf3 libproc2-0 libpsl5 libpython3-dev libpython3-stdlib
libpython3.11 libpython3.11-dev libpython3.11-minimal libpython3.11-stdlib
librhash0 librtmp1 libsigsegv2 libsmartcols1 libssh2-1 libssl-dev libstb-dev
libstb0 libstdc++-13-dev libstdc++6 libsub-override-perl libsuperlu-dev
libsuperlu6 libsz2 libtool libubsan1 libuchardet0 libuuid1 libuv1 libxml2
libxml2-dev m4 man-db media-types mount netbase openssl pkg-config pkgconf
pkgconf-bin po-debconf procps python3 python3-dateutil python3-dev
python3-distutils python3-lib2to3 python3-minimal python3-numpy
python3-pandas python3-pandas-lib python3-pip python3-pkg-resources
python3-pytest-runner python3-setuptools python3-six python3-tz
python3-wheel python3.11 python3.11-dev python3.11-minimal rapidjson-dev
sensible-utils txt2man util-linux zlib1g zlib1g-dev
Suggested packages:
autoconf-archive gnu-standards autoconf-doc cmake-doc cmake-format
elpa-cmake-mode ninja-build gcc-13-locales cpp-13-doc cython-doc dh-make
flit python3-build python3-installer gcc-13-doc gawk-doc gettext-doc
libasprintf-dev libgettextpo-dev groff lrzip libitpp-dev liblapack-doc
libcurl4-doc libidn-dev libkrb5-dev libldap2-dev librtmp-dev libssh2-1-dev
libhdf5-doc icu-doc cryptsetup-bin libssl-doc libstdc++-13-doc
libsuperlu-doc libtool-doc gfortran | fortran95-compiler gcj-jdk m4-doc
apparmor less www-browser nfs-common libmail-box-perl python3-doc python3-tk
python3-venv gfortran python3-pytest python-pandas-doc python3-statsmodels
python-setuptools-doc python3.11-venv python3.11-doc binfmt-support
rapidjson-doc ghostscript dosfstools kbd util-linux-extra util-linux-locales
Recommended packages:
curl | wget | lynx libarchive-cpio-perl javascript-common publicsuffix
libltdl-dev uuid-runtime libmail-sendmail-perl psmisc python3-scipy
python3-matplotlib python3-bottleneck python3-numexpr python3-odf
python3-openpyxl python3-bs4 python3-html5lib python3-lxml python3-tables
python3-jinja2
The following NEW packages will be installed:
autoconf automake autopoint autotools-dev bsdextrautils ca-certificates
cmake cmake-data cython3 debhelper dh-autoreconf dh-python
dh-strip-nondeterminism dwz file gawk gettext gettext-base groff-base
hdf5-helpers icu-devtools intltool-debian libaec-dev libaec0
libarchive-zip-perl libarchive13 libarmadillo-dev libarmadillo12 libarpack2
libarpack2-dev libblas-dev libblas3 libbrotli1 libcereal-dev libcurl4
libcurl4-openssl-dev libdebhelper-perl libelf1 libensmallen-dev libexpat1
libexpat1-dev libfile-stripnondeterminism-perl libgfortran5 libhdf5-103-1
libhdf5-cpp-103-1 libhdf5-dev libhdf5-fortran-102 libhdf5-hl-100
libhdf5-hl-cpp-100 libhdf5-hl-fortran-100 libicu-dev libicu72 libjpeg-dev
libjpeg62-turbo libjpeg62-turbo-dev libjs-jquery libjs-sphinxdoc
libjs-underscore libjsoncpp25 liblapack-dev liblapack3 libmagic-mgc
libmagic1 libnghttp2-14 libpipeline1 libpkgconf3 libproc2-0 libpsl5
libpython3-dev libpython3-stdlib libpython3.11 libpython3.11-dev
libpython3.11-minimal libpython3.11-stdlib librhash0 librtmp1 libsigsegv2
libssh2-1 libssl-dev libstb-dev libstb0 libsub-override-perl libsuperlu-dev
libsuperlu6 libsz2 libtool libuchardet0 libuv1 libxml2 libxml2-dev m4 man-db
media-types netbase openssl pkg-config pkgconf pkgconf-bin po-debconf procps
python3 python3-dateutil python3-dev python3-distutils python3-lib2to3
python3-minimal python3-numpy python3-pandas python3-pandas-lib python3-pip
python3-pkg-resources python3-pytest-runner python3-setuptools python3-six
python3-tz python3-wheel python3.11 python3.11-dev python3.11-minimal
rapidjson-dev sbuild-build-depends-main-dummy sensible-utils txt2man
zlib1g-dev
The following packages will be upgraded:
bsdutils cpp-13 g++-13 gcc-13 gcc-13-base libasan8 libatomic1 libblkid1
libcc1-0 libgcc-13-dev libgcc-s1 libgomp1 libmount1 libsmartcols1
libstdc++-13-dev libstdc++6 libubsan1 libuuid1 mount util-linux zlib1g
21 upgraded, 124 newly installed, 0 to remove and 21 not upgraded.
Need to get 124 MB of archives.
After this operation, 365 MB of additional disk space will be used.
Get:1 copy:/<<RESOLVERDIR>>/apt_archive ./ sbuild-build-depends-main-dummy 0.invalid.0 [996 B]
Get:2 http://172.17.4.1/private trixie-staging/main armhf bsdutils armhf 1:2.39.3-6 [87.1 kB]
Get:3 http://172.17.4.1/private trixie-staging/main armhf util-linux armhf 2.39.3-6 [1113 kB]
Get:4 http://172.17.4.1/private trixie-staging/main armhf mount armhf 2.39.3-6 [134 kB]
Get:5 http://172.17.4.1/private trixie-staging/main armhf libsigsegv2 armhf 2.14-1 [36.6 kB]
Get:6 http://172.17.4.1/private trixie-staging/main armhf gawk armhf 1:5.2.1-2 [595 kB]
Get:7 http://172.17.4.1/private trixie-staging/main armhf libpython3.11-minimal armhf 3.11.7-2 [801 kB]
Get:8 http://172.17.4.1/private trixie-staging/main armhf libcc1-0 armhf 13.2.0-9+rpi1 [35.4 kB]
Get:9 http://172.17.4.1/private trixie-staging/main armhf gcc-13-base armhf 13.2.0-9+rpi1 [41.7 kB]
Get:10 http://172.17.4.1/private trixie-staging/main armhf libgcc-s1 armhf 13.2.0-9+rpi1 [36.2 kB]
Get:11 http://172.17.4.1/private trixie-staging/main armhf libgomp1 armhf 13.2.0-9+rpi1 [104 kB]
Get:12 http://172.17.4.1/private trixie-staging/main armhf libatomic1 armhf 13.2.0-9+rpi1 [8448 B]
Get:13 http://172.17.4.1/private trixie-staging/main armhf libasan8 armhf 13.2.0-9+rpi1 [2391 kB]
Get:14 http://172.17.4.1/private trixie-staging/main armhf libubsan1 armhf 13.2.0-9+rpi1 [964 kB]
Get:15 http://172.17.4.1/private trixie-staging/main armhf g++-13 armhf 13.2.0-9+rpi1 [8138 kB]
Get:16 http://172.17.4.1/private trixie-staging/main armhf libstdc++-13-dev armhf 13.2.0-9+rpi1 [2209 kB]
Get:17 http://172.17.4.1/private trixie-staging/main armhf libgcc-13-dev armhf 13.2.0-9+rpi1 [763 kB]
Get:18 http://172.17.4.1/private trixie-staging/main armhf gcc-13 armhf 13.2.0-9+rpi1 [14.7 MB]
Get:19 http://172.17.4.1/private trixie-staging/main armhf cpp-13 armhf 13.2.0-9+rpi1 [7372 kB]
Get:20 http://172.17.4.1/private trixie-staging/main armhf libstdc++6 armhf 13.2.0-9+rpi1 [578 kB]
Get:21 http://172.17.4.1/private trixie-staging/main armhf zlib1g armhf 1:1.3.dfsg-3 [74.3 kB]
Get:22 http://172.17.4.1/private trixie-staging/main armhf libexpat1 armhf 2.5.0-2 [76.8 kB]
Get:23 http://172.17.4.1/private trixie-staging/main armhf python3.11-minimal armhf 3.11.7-2 [1677 kB]
Get:24 http://172.17.4.1/private trixie-staging/main armhf python3-minimal armhf 3.11.4-5 [26.2 kB]
Get:25 http://172.17.4.1/private trixie-staging/main armhf media-types all 10.1.0 [26.9 kB]
Get:26 http://172.17.4.1/private trixie-staging/main armhf netbase all 6.4 [12.8 kB]
Get:27 http://172.17.4.1/private trixie-staging/main armhf libuuid1 armhf 2.39.3-6 [28.3 kB]
Get:28 http://172.17.4.1/private trixie-staging/main armhf libpython3.11-stdlib armhf 3.11.7-2 [1694 kB]
Get:29 http://172.17.4.1/private trixie-staging/main armhf python3.11 armhf 3.11.7-2 [590 kB]
Get:30 http://172.17.4.1/private trixie-staging/main armhf libpython3-stdlib armhf 3.11.4-5 [9200 B]
Get:31 http://172.17.4.1/private trixie-staging/main armhf python3 armhf 3.11.4-5 [26.2 kB]
Get:32 http://172.17.4.1/private trixie-staging/main armhf libblkid1 armhf 2.39.3-6 [145 kB]
Get:33 http://172.17.4.1/private trixie-staging/main armhf libmount1 armhf 2.39.3-6 [168 kB]
Get:34 http://172.17.4.1/private trixie-staging/main armhf libsmartcols1 armhf 2.39.3-6 [102 kB]
Get:35 http://172.17.4.1/private trixie-staging/main armhf libuchardet0 armhf 0.0.8-1 [65.5 kB]
Get:36 http://172.17.4.1/private trixie-staging/main armhf groff-base armhf 1.23.0-3 [1033 kB]
Get:37 http://172.17.4.1/private trixie-staging/main armhf bsdextrautils armhf 2.39.3-6 [81.4 kB]
Get:38 http://172.17.4.1/private trixie-staging/main armhf libpipeline1 armhf 1.5.7-1 [33.4 kB]
Get:39 http://172.17.4.1/private trixie-staging/main armhf man-db armhf 2.12.0-1 [1358 kB]
Get:40 http://172.17.4.1/private trixie-staging/main armhf libproc2-0 armhf 2:4.0.4-2 [54.9 kB]
Get:41 http://172.17.4.1/private trixie-staging/main armhf procps armhf 2:4.0.4-2 [848 kB]
Get:42 http://172.17.4.1/private trixie-staging/main armhf sensible-utils all 0.0.20 [19.3 kB]
Get:43 http://172.17.4.1/private trixie-staging/main armhf openssl armhf 3.1.4-2 [1375 kB]
Get:44 http://172.17.4.1/private trixie-staging/main armhf ca-certificates all 20230311 [153 kB]
Get:45 http://172.17.4.1/private trixie-staging/main armhf libmagic-mgc armhf 1:5.45-2 [314 kB]
Get:46 http://172.17.4.1/private trixie-staging/main armhf libmagic1 armhf 1:5.45-2 [96.1 kB]
Get:47 http://172.17.4.1/private trixie-staging/main armhf file armhf 1:5.45-2 [41.6 kB]
Get:48 http://172.17.4.1/private trixie-staging/main armhf gettext-base armhf 0.21-14 [157 kB]
Get:49 http://172.17.4.1/private trixie-staging/main armhf m4 armhf 1.4.19-4 [256 kB]
Get:50 http://172.17.4.1/private trixie-staging/main armhf autoconf all 2.71-3 [332 kB]
Get:51 http://172.17.4.1/private trixie-staging/main armhf autotools-dev all 20220109.1 [51.6 kB]
Get:52 http://172.17.4.1/private trixie-staging/main armhf automake all 1:1.16.5-1.3 [823 kB]
Get:53 http://172.17.4.1/private trixie-staging/main armhf autopoint all 0.21-14 [496 kB]
Get:54 http://172.17.4.1/private trixie-staging/main armhf libicu72 armhf 72.1-4 [9009 kB]
Get:55 http://172.17.4.1/private trixie-staging/main armhf libxml2 armhf 2.9.14+dfsg-1.3 [571 kB]
Get:56 http://172.17.4.1/private trixie-staging/main armhf libarchive13 armhf 3.7.2-1 [294 kB]
Get:57 http://172.17.4.1/private trixie-staging/main armhf libbrotli1 armhf 1.1.0-2 [280 kB]
Get:58 http://172.17.4.1/private trixie-staging/main armhf libnghttp2-14 armhf 1.58.0-1 [61.7 kB]
Get:59 http://172.17.4.1/private trixie-staging/main armhf libpsl5 armhf 0.21.2-1+b1 [57.8 kB]
Get:60 http://172.17.4.1/private trixie-staging/main armhf librtmp1 armhf 2.4+20151223.gitfa8646d.1-2+b2 [54.2 kB]
Get:61 http://172.17.4.1/private trixie-staging/main armhf libssh2-1 armhf 1.11.0-4 [195 kB]
Get:62 http://172.17.4.1/private trixie-staging/main armhf libcurl4 armhf 8.5.0-2+rpi1 [377 kB]
Get:63 http://172.17.4.1/private trixie-staging/main armhf libjsoncpp25 armhf 1.9.5-6 [64.7 kB]
Get:64 http://172.17.4.1/private trixie-staging/main armhf librhash0 armhf 1.4.3-3 [142 kB]
Get:65 http://172.17.4.1/private trixie-staging/main armhf libuv1 armhf 1.46.0-2+rpi1 [128 kB]
Get:66 http://172.17.4.1/private trixie-staging/main armhf cmake-data all 3.28.1-1 [2127 kB]
Get:67 http://172.17.4.1/private trixie-staging/main armhf cmake armhf 3.28.1-1 [7787 kB]
Get:68 http://172.17.4.1/private trixie-staging/main armhf cython3 armhf 3.0.7-2 [3440 kB]
Get:69 http://172.17.4.1/private trixie-staging/main armhf libdebhelper-perl all 13.11.9 [82.3 kB]
Get:70 http://172.17.4.1/private trixie-staging/main armhf libtool all 2.4.7-7 [517 kB]
Get:71 http://172.17.4.1/private trixie-staging/main armhf dh-autoreconf all 20 [17.1 kB]
Get:72 http://172.17.4.1/private trixie-staging/main armhf libarchive-zip-perl all 1.68-1 [104 kB]
Get:73 http://172.17.4.1/private trixie-staging/main armhf libsub-override-perl all 0.10-1 [10.6 kB]
Get:74 http://172.17.4.1/private trixie-staging/main armhf libfile-stripnondeterminism-perl all 1.13.1-1 [19.4 kB]
Get:75 http://172.17.4.1/private trixie-staging/main armhf dh-strip-nondeterminism all 1.13.1-1 [8620 B]
Get:76 http://172.17.4.1/private trixie-staging/main armhf libelf1 armhf 0.188-2.1+rpi1 [171 kB]
Get:77 http://172.17.4.1/private trixie-staging/main armhf dwz armhf 0.15-1 [92.4 kB]
Get:78 http://172.17.4.1/private trixie-staging/main armhf gettext armhf 0.21-14 [1203 kB]
Get:79 http://172.17.4.1/private trixie-staging/main armhf intltool-debian all 0.35.0+20060710.6 [22.9 kB]
Get:80 http://172.17.4.1/private trixie-staging/main armhf po-debconf all 1.0.21+nmu1 [248 kB]
Get:81 http://172.17.4.1/private trixie-staging/main armhf debhelper all 13.11.9 [956 kB]
Get:82 http://172.17.4.1/private trixie-staging/main armhf python3-lib2to3 all 3.11.5-1 [77.5 kB]
Get:83 http://172.17.4.1/private trixie-staging/main armhf python3-distutils all 3.11.5-1 [131 kB]
Get:84 http://172.17.4.1/private trixie-staging/main armhf python3-pkg-resources all 68.1.2-2 [241 kB]
Get:85 http://172.17.4.1/private trixie-staging/main armhf python3-setuptools all 68.1.2-2 [468 kB]
Get:86 http://172.17.4.1/private trixie-staging/main armhf dh-python all 6.20231223 [108 kB]
Get:87 http://172.17.4.1/private trixie-staging/main armhf hdf5-helpers armhf 1.10.10+repack-3 [23.2 kB]
Get:88 http://172.17.4.1/private trixie-staging/main armhf icu-devtools armhf 72.1-4 [174 kB]
Get:89 http://172.17.4.1/private trixie-staging/main armhf libaec0 armhf 1.1.2-1 [21.3 kB]
Get:90 http://172.17.4.1/private trixie-staging/main armhf libsz2 armhf 1.1.2-1 [7700 B]
Get:91 http://172.17.4.1/private trixie-staging/main armhf libaec-dev armhf 1.1.2-1 [18.4 kB]
Get:92 http://172.17.4.1/private trixie-staging/main armhf libblas3 armhf 3.11.0-2 [100.0 kB]
Get:93 http://172.17.4.1/private trixie-staging/main armhf libgfortran5 armhf 13.2.0-9+rpi1 [247 kB]
Get:94 http://172.17.4.1/private trixie-staging/main armhf liblapack3 armhf 3.11.0-2 [1624 kB]
Get:95 http://172.17.4.1/private trixie-staging/main armhf libarpack2 armhf 3.9.1-1 [80.8 kB]
Get:96 http://172.17.4.1/private trixie-staging/main armhf libsuperlu6 armhf 6.0.1+dfsg1-1 [130 kB]
Get:97 http://172.17.4.1/private trixie-staging/main armhf libarmadillo12 armhf 1:12.6.7+dfsg-1 [99.5 kB]
Get:98 http://172.17.4.1/private trixie-staging/main armhf libblas-dev armhf 3.11.0-2 [106 kB]
Get:99 http://172.17.4.1/private trixie-staging/main armhf liblapack-dev armhf 3.11.0-2 [3007 kB]
Get:100 http://172.17.4.1/private trixie-staging/main armhf libarpack2-dev armhf 3.9.1-1 [91.6 kB]
Get:101 http://172.17.4.1/private trixie-staging/main armhf libhdf5-103-1 armhf 1.10.10+repack-3 [1215 kB]
Get:102 http://172.17.4.1/private trixie-staging/main armhf libhdf5-fortran-102 armhf 1.10.10+repack-3 [77.3 kB]
Get:103 http://172.17.4.1/private trixie-staging/main armhf libhdf5-hl-100 armhf 1.10.10+repack-3 [59.9 kB]
Get:104 http://172.17.4.1/private trixie-staging/main armhf libhdf5-hl-fortran-100 armhf 1.10.10+repack-3 [34.1 kB]
Get:105 http://172.17.4.1/private trixie-staging/main armhf libhdf5-cpp-103-1 armhf 1.10.10+repack-3 [112 kB]
Get:106 http://172.17.4.1/private trixie-staging/main armhf libhdf5-hl-cpp-100 armhf 1.10.10+repack-3 [20.5 kB]
Get:107 http://172.17.4.1/private trixie-staging/main armhf zlib1g-dev armhf 1:1.3.dfsg-3 [903 kB]
Get:108 http://172.17.4.1/private trixie-staging/main armhf libjpeg62-turbo armhf 1:2.1.5-2 [143 kB]
Get:109 http://172.17.4.1/private trixie-staging/main armhf libjpeg62-turbo-dev armhf 1:2.1.5-2 [258 kB]
Get:110 http://172.17.4.1/private trixie-staging/main armhf libjpeg-dev armhf 1:2.1.5-2 [71.8 kB]
Get:111 http://172.17.4.1/private trixie-staging/main armhf libcurl4-openssl-dev armhf 8.5.0-2+rpi1 [461 kB]
Get:112 http://172.17.4.1/private trixie-staging/main armhf libssl-dev armhf 3.1.4-2 [2115 kB]
Get:113 http://172.17.4.1/private trixie-staging/main armhf libhdf5-dev armhf 1.10.10+repack-3 [2314 kB]
Get:114 http://172.17.4.1/private trixie-staging/main armhf libsuperlu-dev armhf 6.0.1+dfsg1-1 [21.5 kB]
Get:115 http://172.17.4.1/private trixie-staging/main armhf libarmadillo-dev armhf 1:12.6.7+dfsg-1 [408 kB]
Get:116 http://172.17.4.1/private trixie-staging/main armhf rapidjson-dev all 1.1.0+dfsg2-7.1 [97.7 kB]
Get:117 http://172.17.4.1/private trixie-staging/main armhf libcereal-dev armhf 1.3.2+dfsg-4+rpi1 [221 kB]
Get:118 http://172.17.4.1/private trixie-staging/main armhf libensmallen-dev armhf 2.21.0-1 [211 kB]
Get:119 http://172.17.4.1/private trixie-staging/main armhf libexpat1-dev armhf 2.5.0-2 [130 kB]
Get:120 http://172.17.4.1/private trixie-staging/main armhf libicu-dev armhf 72.1-4 [9956 kB]
Get:121 http://172.17.4.1/private trixie-staging/main armhf libjs-jquery all 3.6.1+dfsg+~3.5.14-1 [326 kB]
Get:122 http://172.17.4.1/private trixie-staging/main armhf libjs-underscore all 1.13.4~dfsg+~1.11.4-3 [116 kB]
Get:123 http://172.17.4.1/private trixie-staging/main armhf libjs-sphinxdoc all 7.2.6-3 [149 kB]
Get:124 http://172.17.4.1/private trixie-staging/main armhf libpkgconf3 armhf 1.8.1-1 [31.3 kB]
Get:125 http://172.17.4.1/private trixie-staging/main armhf libpython3.11 armhf 3.11.7-2 [1670 kB]
Get:126 http://172.17.4.1/private trixie-staging/main armhf libpython3.11-dev armhf 3.11.7-2 [3287 kB]
Get:127 http://172.17.4.1/private trixie-staging/main armhf libpython3-dev armhf 3.11.4-5 [9432 B]
Get:128 http://172.17.4.1/private trixie-staging/main armhf libstb0 armhf 0.0~git20230129.5736b15+ds-1 [175 kB]
Get:129 http://172.17.4.1/private trixie-staging/main armhf libstb-dev armhf 0.0~git20230129.5736b15+ds-1 [557 kB]
Get:130 http://172.17.4.1/private trixie-staging/main armhf libxml2-dev armhf 2.9.14+dfsg-1.3 [636 kB]
Get:131 http://172.17.4.1/private trixie-staging/main armhf pkgconf-bin armhf 1.8.1-1 [27.8 kB]
Get:132 http://172.17.4.1/private trixie-staging/main armhf pkgconf armhf 1.8.1-1 [25.9 kB]
Get:133 http://172.17.4.1/private trixie-staging/main armhf pkg-config armhf 1.8.1-1 [13.7 kB]
Get:134 http://172.17.4.1/private trixie-staging/main armhf python3-six all 1.16.0-4 [17.5 kB]
Get:135 http://172.17.4.1/private trixie-staging/main armhf python3-dateutil all 2.8.2-3 [78.4 kB]
Get:136 http://172.17.4.1/private trixie-staging/main armhf python3.11-dev armhf 3.11.7-2 [508 kB]
Get:137 http://172.17.4.1/private trixie-staging/main armhf python3-dev armhf 3.11.4-5 [26.2 kB]
Get:138 http://172.17.4.1/private trixie-staging/main armhf python3-numpy armhf 1:1.24.2-2 [3164 kB]
Get:139 http://172.17.4.1/private trixie-staging/main armhf python3-tz all 2023.3.post1-2 [30.9 kB]
Get:140 http://172.17.4.1/private trixie-staging/main armhf python3-pandas-lib armhf 1.5.3+dfsg-10 [3005 kB]
Get:141 http://172.17.4.1/private trixie-staging/main armhf python3-pandas all 1.5.3+dfsg-10 [2886 kB]
Get:142 http://172.17.4.1/private trixie-staging/main armhf python3-wheel all 0.42.0-1 [52.1 kB]
Get:143 http://172.17.4.1/private trixie-staging/main armhf python3-pip all 23.3+dfsg-1 [1346 kB]
Get:144 http://172.17.4.1/private trixie-staging/main armhf python3-pytest-runner all 2.11.1-4 [8432 B]
Get:145 http://172.17.4.1/private trixie-staging/main armhf txt2man all 1.7.1-4 [35.4 kB]
debconf: delaying package configuration, since apt-utils is not installed
Fetched 124 MB in 14s (8865 kB/s)
(Reading database ... 12735 files and directories currently installed.)
Preparing to unpack .../bsdutils_1%3a2.39.3-6_armhf.deb ...
Unpacking bsdutils (1:2.39.3-6) over (1:2.39.3-2) ...
Setting up bsdutils (1:2.39.3-6) ...
(Reading database ... 12735 files and directories currently installed.)
Preparing to unpack .../util-linux_2.39.3-6_armhf.deb ...
Unpacking util-linux (2.39.3-6) over (2.39.3-2) ...
Setting up util-linux (2.39.3-6) ...
(Reading database ... 12735 files and directories currently installed.)
Preparing to unpack .../mount_2.39.3-6_armhf.deb ...
Unpacking mount (2.39.3-6) over (2.39.3-2) ...
Selecting previously unselected package libsigsegv2:armhf.
Preparing to unpack .../libsigsegv2_2.14-1_armhf.deb ...
Unpacking libsigsegv2:armhf (2.14-1) ...
Setting up libsigsegv2:armhf (2.14-1) ...
Selecting previously unselected package gawk.
(Reading database ... 12744 files and directories currently installed.)
Preparing to unpack .../gawk_1%3a5.2.1-2_armhf.deb ...
Unpacking gawk (1:5.2.1-2) ...
Selecting previously unselected package libpython3.11-minimal:armhf.
Preparing to unpack .../libpython3.11-minimal_3.11.7-2_armhf.deb ...
Unpacking libpython3.11-minimal:armhf (3.11.7-2) ...
Preparing to unpack .../libcc1-0_13.2.0-9+rpi1_armhf.deb ...
Unpacking libcc1-0:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../gcc-13-base_13.2.0-9+rpi1_armhf.deb ...
Unpacking gcc-13-base:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Setting up gcc-13-base:armhf (13.2.0-9+rpi1) ...
(Reading database ... 13228 files and directories currently installed.)
Preparing to unpack .../libgcc-s1_13.2.0-9+rpi1_armhf.deb ...
Unpacking libgcc-s1:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Setting up libgcc-s1:armhf (13.2.0-9+rpi1) ...
(Reading database ... 13228 files and directories currently installed.)
Preparing to unpack .../libgomp1_13.2.0-9+rpi1_armhf.deb ...
Unpacking libgomp1:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../libatomic1_13.2.0-9+rpi1_armhf.deb ...
Unpacking libatomic1:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Setting up libatomic1:armhf (13.2.0-9+rpi1) ...
(Reading database ... 13228 files and directories currently installed.)
Preparing to unpack .../0-libasan8_13.2.0-9+rpi1_armhf.deb ...
Unpacking libasan8:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../1-libubsan1_13.2.0-9+rpi1_armhf.deb ...
Unpacking libubsan1:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../2-g++-13_13.2.0-9+rpi1_armhf.deb ...
Unpacking g++-13 (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../3-libstdc++-13-dev_13.2.0-9+rpi1_armhf.deb ...
Unpacking libstdc++-13-dev:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../4-libgcc-13-dev_13.2.0-9+rpi1_armhf.deb ...
Unpacking libgcc-13-dev:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../5-gcc-13_13.2.0-9+rpi1_armhf.deb ...
Unpacking gcc-13 (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../6-cpp-13_13.2.0-9+rpi1_armhf.deb ...
Unpacking cpp-13 (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Preparing to unpack .../7-libstdc++6_13.2.0-9+rpi1_armhf.deb ...
Unpacking libstdc++6:armhf (13.2.0-9+rpi1) over (13.2.0-7+rpi1) ...
Setting up libstdc++6:armhf (13.2.0-9+rpi1) ...
(Reading database ... 13228 files and directories currently installed.)
Preparing to unpack .../zlib1g_1%3a1.3.dfsg-3_armhf.deb ...
Unpacking zlib1g:armhf (1:1.3.dfsg-3) over (1:1.2.13.dfsg-3) ...
Setting up zlib1g:armhf (1:1.3.dfsg-3) ...
Selecting previously unselected package libexpat1:armhf.
(Reading database ... 13228 files and directories currently installed.)
Preparing to unpack .../libexpat1_2.5.0-2_armhf.deb ...
Unpacking libexpat1:armhf (2.5.0-2) ...
Selecting previously unselected package python3.11-minimal.
Preparing to unpack .../python3.11-minimal_3.11.7-2_armhf.deb ...
Unpacking python3.11-minimal (3.11.7-2) ...
Setting up libpython3.11-minimal:armhf (3.11.7-2) ...
Setting up libexpat1:armhf (2.5.0-2) ...
Setting up python3.11-minimal (3.11.7-2) ...
Selecting previously unselected package python3-minimal.
(Reading database ... 13248 files and directories currently installed.)
Preparing to unpack .../python3-minimal_3.11.4-5_armhf.deb ...
Unpacking python3-minimal (3.11.4-5) ...
Selecting previously unselected package media-types.
Preparing to unpack .../media-types_10.1.0_all.deb ...
Unpacking media-types (10.1.0) ...
Selecting previously unselected package netbase.
Preparing to unpack .../archives/netbase_6.4_all.deb ...
Unpacking netbase (6.4) ...
Preparing to unpack .../libuuid1_2.39.3-6_armhf.deb ...
Unpacking libuuid1:armhf (2.39.3-6) over (2.39.3-2) ...
Setting up libuuid1:armhf (2.39.3-6) ...
Selecting previously unselected package libpython3.11-stdlib:armhf.
(Reading database ... 13282 files and directories currently installed.)
Preparing to unpack .../libpython3.11-stdlib_3.11.7-2_armhf.deb ...
Unpacking libpython3.11-stdlib:armhf (3.11.7-2) ...
Selecting previously unselected package python3.11.
Preparing to unpack .../python3.11_3.11.7-2_armhf.deb ...
Unpacking python3.11 (3.11.7-2) ...
Selecting previously unselected package libpython3-stdlib:armhf.
Preparing to unpack .../libpython3-stdlib_3.11.4-5_armhf.deb ...
Unpacking libpython3-stdlib:armhf (3.11.4-5) ...
Setting up python3-minimal (3.11.4-5) ...
Selecting previously unselected package python3.
(Reading database ... 13682 files and directories currently installed.)
Preparing to unpack .../python3_3.11.4-5_armhf.deb ...
Unpacking python3 (3.11.4-5) ...
Preparing to unpack .../libblkid1_2.39.3-6_armhf.deb ...
Unpacking libblkid1:armhf (2.39.3-6) over (2.39.3-2) ...
Setting up libblkid1:armhf (2.39.3-6) ...
(Reading database ... 13703 files and directories currently installed.)
Preparing to unpack .../libmount1_2.39.3-6_armhf.deb ...
Unpacking libmount1:armhf (2.39.3-6) over (2.39.3-2) ...
Setting up libmount1:armhf (2.39.3-6) ...
(Reading database ... 13703 files and directories currently installed.)
Preparing to unpack .../libsmartcols1_2.39.3-6_armhf.deb ...
Unpacking libsmartcols1:armhf (2.39.3-6) over (2.39.3-2) ...
Setting up libsmartcols1:armhf (2.39.3-6) ...
Selecting previously unselected package libuchardet0:armhf.
(Reading database ... 13703 files and directories currently installed.)
Preparing to unpack .../000-libuchardet0_0.0.8-1_armhf.deb ...
Unpacking libuchardet0:armhf (0.0.8-1) ...
Selecting previously unselected package groff-base.
Preparing to unpack .../001-groff-base_1.23.0-3_armhf.deb ...
Unpacking groff-base (1.23.0-3) ...
Selecting previously unselected package bsdextrautils.
Preparing to unpack .../002-bsdextrautils_2.39.3-6_armhf.deb ...
Unpacking bsdextrautils (2.39.3-6) ...
Selecting previously unselected package libpipeline1:armhf.
Preparing to unpack .../003-libpipeline1_1.5.7-1_armhf.deb ...
Unpacking libpipeline1:armhf (1.5.7-1) ...
Selecting previously unselected package man-db.
Preparing to unpack .../004-man-db_2.12.0-1_armhf.deb ...
Unpacking man-db (2.12.0-1) ...
Selecting previously unselected package libproc2-0:armhf.
Preparing to unpack .../005-libproc2-0_2%3a4.0.4-2_armhf.deb ...
Unpacking libproc2-0:armhf (2:4.0.4-2) ...
Selecting previously unselected package procps.
Preparing to unpack .../006-procps_2%3a4.0.4-2_armhf.deb ...
Unpacking procps (2:4.0.4-2) ...
Selecting previously unselected package sensible-utils.
Preparing to unpack .../007-sensible-utils_0.0.20_all.deb ...
Unpacking sensible-utils (0.0.20) ...
Selecting previously unselected package openssl.
Preparing to unpack .../008-openssl_3.1.4-2_armhf.deb ...
Unpacking openssl (3.1.4-2) ...
Selecting previously unselected package ca-certificates.
Preparing to unpack .../009-ca-certificates_20230311_all.deb ...
Unpacking ca-certificates (20230311) ...
Selecting previously unselected package libmagic-mgc.
Preparing to unpack .../010-libmagic-mgc_1%3a5.45-2_armhf.deb ...
Unpacking libmagic-mgc (1:5.45-2) ...
Selecting previously unselected package libmagic1:armhf.
Preparing to unpack .../011-libmagic1_1%3a5.45-2_armhf.deb ...
Unpacking libmagic1:armhf (1:5.45-2) ...
Selecting previously unselected package file.
Preparing to unpack .../012-file_1%3a5.45-2_armhf.deb ...
Unpacking file (1:5.45-2) ...
Selecting previously unselected package gettext-base.
Preparing to unpack .../013-gettext-base_0.21-14_armhf.deb ...
Unpacking gettext-base (0.21-14) ...
Selecting previously unselected package m4.
Preparing to unpack .../014-m4_1.4.19-4_armhf.deb ...
Unpacking m4 (1.4.19-4) ...
Selecting previously unselected package autoconf.
Preparing to unpack .../015-autoconf_2.71-3_all.deb ...
Unpacking autoconf (2.71-3) ...
Selecting previously unselected package autotools-dev.
Preparing to unpack .../016-autotools-dev_20220109.1_all.deb ...
Unpacking autotools-dev (20220109.1) ...
Selecting previously unselected package automake.
Preparing to unpack .../017-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 .../018-autopoint_0.21-14_all.deb ...
Unpacking autopoint (0.21-14) ...
Selecting previously unselected package libicu72:armhf.
Preparing to unpack .../019-libicu72_72.1-4_armhf.deb ...
Unpacking libicu72:armhf (72.1-4) ...
Selecting previously unselected package libxml2:armhf.
Preparing to unpack .../020-libxml2_2.9.14+dfsg-1.3_armhf.deb ...
Unpacking libxml2:armhf (2.9.14+dfsg-1.3) ...
Selecting previously unselected package libarchive13:armhf.
Preparing to unpack .../021-libarchive13_3.7.2-1_armhf.deb ...
Unpacking libarchive13:armhf (3.7.2-1) ...
Selecting previously unselected package libbrotli1:armhf.
Preparing to unpack .../022-libbrotli1_1.1.0-2_armhf.deb ...
Unpacking libbrotli1:armhf (1.1.0-2) ...
Selecting previously unselected package libnghttp2-14:armhf.
Preparing to unpack .../023-libnghttp2-14_1.58.0-1_armhf.deb ...
Unpacking libnghttp2-14:armhf (1.58.0-1) ...
Selecting previously unselected package libpsl5:armhf.
Preparing to unpack .../024-libpsl5_0.21.2-1+b1_armhf.deb ...
Unpacking libpsl5:armhf (0.21.2-1+b1) ...
Selecting previously unselected package librtmp1:armhf.
Preparing to unpack .../025-librtmp1_2.4+20151223.gitfa8646d.1-2+b2_armhf.deb ...
Unpacking librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b2) ...
Selecting previously unselected package libssh2-1:armhf.
Preparing to unpack .../026-libssh2-1_1.11.0-4_armhf.deb ...
Unpacking libssh2-1:armhf (1.11.0-4) ...
Selecting previously unselected package libcurl4:armhf.
Preparing to unpack .../027-libcurl4_8.5.0-2+rpi1_armhf.deb ...
Unpacking libcurl4:armhf (8.5.0-2+rpi1) ...
Selecting previously unselected package libjsoncpp25:armhf.
Preparing to unpack .../028-libjsoncpp25_1.9.5-6_armhf.deb ...
Unpacking libjsoncpp25:armhf (1.9.5-6) ...
Selecting previously unselected package librhash0:armhf.
Preparing to unpack .../029-librhash0_1.4.3-3_armhf.deb ...
Unpacking librhash0:armhf (1.4.3-3) ...
Selecting previously unselected package libuv1:armhf.
Preparing to unpack .../030-libuv1_1.46.0-2+rpi1_armhf.deb ...
Unpacking libuv1:armhf (1.46.0-2+rpi1) ...
Selecting previously unselected package cmake-data.
Preparing to unpack .../031-cmake-data_3.28.1-1_all.deb ...
Unpacking cmake-data (3.28.1-1) ...
Selecting previously unselected package cmake.
Preparing to unpack .../032-cmake_3.28.1-1_armhf.deb ...
Unpacking cmake (3.28.1-1) ...
Selecting previously unselected package cython3.
Preparing to unpack .../033-cython3_3.0.7-2_armhf.deb ...
Unpacking cython3 (3.0.7-2) ...
Selecting previously unselected package libdebhelper-perl.
Preparing to unpack .../034-libdebhelper-perl_13.11.9_all.deb ...
Unpacking libdebhelper-perl (13.11.9) ...
Selecting previously unselected package libtool.
Preparing to unpack .../035-libtool_2.4.7-7_all.deb ...
Unpacking libtool (2.4.7-7) ...
Selecting previously unselected package dh-autoreconf.
Preparing to unpack .../036-dh-autoreconf_20_all.deb ...
Unpacking dh-autoreconf (20) ...
Selecting previously unselected package libarchive-zip-perl.
Preparing to unpack .../037-libarchive-zip-perl_1.68-1_all.deb ...
Unpacking libarchive-zip-perl (1.68-1) ...
Selecting previously unselected package libsub-override-perl.
Preparing to unpack .../038-libsub-override-perl_0.10-1_all.deb ...
Unpacking libsub-override-perl (0.10-1) ...
Selecting previously unselected package libfile-stripnondeterminism-perl.
Preparing to unpack .../039-libfile-stripnondeterminism-perl_1.13.1-1_all.deb ...
Unpacking libfile-stripnondeterminism-perl (1.13.1-1) ...
Selecting previously unselected package dh-strip-nondeterminism.
Preparing to unpack .../040-dh-strip-nondeterminism_1.13.1-1_all.deb ...
Unpacking dh-strip-nondeterminism (1.13.1-1) ...
Selecting previously unselected package libelf1:armhf.
Preparing to unpack .../041-libelf1_0.188-2.1+rpi1_armhf.deb ...
Unpacking libelf1:armhf (0.188-2.1+rpi1) ...
Selecting previously unselected package dwz.
Preparing to unpack .../042-dwz_0.15-1_armhf.deb ...
Unpacking dwz (0.15-1) ...
Selecting previously unselected package gettext.
Preparing to unpack .../043-gettext_0.21-14_armhf.deb ...
Unpacking gettext (0.21-14) ...
Selecting previously unselected package intltool-debian.
Preparing to unpack .../044-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 .../045-po-debconf_1.0.21+nmu1_all.deb ...
Unpacking po-debconf (1.0.21+nmu1) ...
Selecting previously unselected package debhelper.
Preparing to unpack .../046-debhelper_13.11.9_all.deb ...
Unpacking debhelper (13.11.9) ...
Selecting previously unselected package python3-lib2to3.
Preparing to unpack .../047-python3-lib2to3_3.11.5-1_all.deb ...
Unpacking python3-lib2to3 (3.11.5-1) ...
Selecting previously unselected package python3-distutils.
Preparing to unpack .../048-python3-distutils_3.11.5-1_all.deb ...
Unpacking python3-distutils (3.11.5-1) ...
Selecting previously unselected package python3-pkg-resources.
Preparing to unpack .../049-python3-pkg-resources_68.1.2-2_all.deb ...
Unpacking python3-pkg-resources (68.1.2-2) ...
Selecting previously unselected package python3-setuptools.
Preparing to unpack .../050-python3-setuptools_68.1.2-2_all.deb ...
Unpacking python3-setuptools (68.1.2-2) ...
Selecting previously unselected package dh-python.
Preparing to unpack .../051-dh-python_6.20231223_all.deb ...
Unpacking dh-python (6.20231223) ...
Selecting previously unselected package hdf5-helpers.
Preparing to unpack .../052-hdf5-helpers_1.10.10+repack-3_armhf.deb ...
Unpacking hdf5-helpers (1.10.10+repack-3) ...
Selecting previously unselected package icu-devtools.
Preparing to unpack .../053-icu-devtools_72.1-4_armhf.deb ...
Unpacking icu-devtools (72.1-4) ...
Selecting previously unselected package libaec0:armhf.
Preparing to unpack .../054-libaec0_1.1.2-1_armhf.deb ...
Unpacking libaec0:armhf (1.1.2-1) ...
Selecting previously unselected package libsz2:armhf.
Preparing to unpack .../055-libsz2_1.1.2-1_armhf.deb ...
Unpacking libsz2:armhf (1.1.2-1) ...
Selecting previously unselected package libaec-dev:armhf.
Preparing to unpack .../056-libaec-dev_1.1.2-1_armhf.deb ...
Unpacking libaec-dev:armhf (1.1.2-1) ...
Selecting previously unselected package libblas3:armhf.
Preparing to unpack .../057-libblas3_3.11.0-2_armhf.deb ...
Unpacking libblas3:armhf (3.11.0-2) ...
Selecting previously unselected package libgfortran5:armhf.
Preparing to unpack .../058-libgfortran5_13.2.0-9+rpi1_armhf.deb ...
Unpacking libgfortran5:armhf (13.2.0-9+rpi1) ...
Selecting previously unselected package liblapack3:armhf.
Preparing to unpack .../059-liblapack3_3.11.0-2_armhf.deb ...
Unpacking liblapack3:armhf (3.11.0-2) ...
Selecting previously unselected package libarpack2:armhf.
Preparing to unpack .../060-libarpack2_3.9.1-1_armhf.deb ...
Unpacking libarpack2:armhf (3.9.1-1) ...
Selecting previously unselected package libsuperlu6:armhf.
Preparing to unpack .../061-libsuperlu6_6.0.1+dfsg1-1_armhf.deb ...
Unpacking libsuperlu6:armhf (6.0.1+dfsg1-1) ...
Selecting previously unselected package libarmadillo12.
Preparing to unpack .../062-libarmadillo12_1%3a12.6.7+dfsg-1_armhf.deb ...
Unpacking libarmadillo12 (1:12.6.7+dfsg-1) ...
Selecting previously unselected package libblas-dev:armhf.
Preparing to unpack .../063-libblas-dev_3.11.0-2_armhf.deb ...
Unpacking libblas-dev:armhf (3.11.0-2) ...
Selecting previously unselected package liblapack-dev:armhf.
Preparing to unpack .../064-liblapack-dev_3.11.0-2_armhf.deb ...
Unpacking liblapack-dev:armhf (3.11.0-2) ...
Selecting previously unselected package libarpack2-dev:armhf.
Preparing to unpack .../065-libarpack2-dev_3.9.1-1_armhf.deb ...
Unpacking libarpack2-dev:armhf (3.9.1-1) ...
Selecting previously unselected package libhdf5-103-1:armhf.
Preparing to unpack .../066-libhdf5-103-1_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-103-1:armhf (1.10.10+repack-3) ...
Selecting previously unselected package libhdf5-fortran-102:armhf.
Preparing to unpack .../067-libhdf5-fortran-102_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-fortran-102:armhf (1.10.10+repack-3) ...
Selecting previously unselected package libhdf5-hl-100:armhf.
Preparing to unpack .../068-libhdf5-hl-100_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-hl-100:armhf (1.10.10+repack-3) ...
Selecting previously unselected package libhdf5-hl-fortran-100:armhf.
Preparing to unpack .../069-libhdf5-hl-fortran-100_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-hl-fortran-100:armhf (1.10.10+repack-3) ...
Selecting previously unselected package libhdf5-cpp-103-1:armhf.
Preparing to unpack .../070-libhdf5-cpp-103-1_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-cpp-103-1:armhf (1.10.10+repack-3) ...
Selecting previously unselected package libhdf5-hl-cpp-100:armhf.
Preparing to unpack .../071-libhdf5-hl-cpp-100_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-hl-cpp-100:armhf (1.10.10+repack-3) ...
Selecting previously unselected package zlib1g-dev:armhf.
Preparing to unpack .../072-zlib1g-dev_1%3a1.3.dfsg-3_armhf.deb ...
Unpacking zlib1g-dev:armhf (1:1.3.dfsg-3) ...
Selecting previously unselected package libjpeg62-turbo:armhf.
Preparing to unpack .../073-libjpeg62-turbo_1%3a2.1.5-2_armhf.deb ...
Unpacking libjpeg62-turbo:armhf (1:2.1.5-2) ...
Selecting previously unselected package libjpeg62-turbo-dev:armhf.
Preparing to unpack .../074-libjpeg62-turbo-dev_1%3a2.1.5-2_armhf.deb ...
Unpacking libjpeg62-turbo-dev:armhf (1:2.1.5-2) ...
Selecting previously unselected package libjpeg-dev:armhf.
Preparing to unpack .../075-libjpeg-dev_1%3a2.1.5-2_armhf.deb ...
Unpacking libjpeg-dev:armhf (1:2.1.5-2) ...
Selecting previously unselected package libcurl4-openssl-dev:armhf.
Preparing to unpack .../076-libcurl4-openssl-dev_8.5.0-2+rpi1_armhf.deb ...
Unpacking libcurl4-openssl-dev:armhf (8.5.0-2+rpi1) ...
Selecting previously unselected package libssl-dev:armhf.
Preparing to unpack .../077-libssl-dev_3.1.4-2_armhf.deb ...
Unpacking libssl-dev:armhf (3.1.4-2) ...
Selecting previously unselected package libhdf5-dev.
Preparing to unpack .../078-libhdf5-dev_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-dev (1.10.10+repack-3) ...
Selecting previously unselected package libsuperlu-dev:armhf.
Preparing to unpack .../079-libsuperlu-dev_6.0.1+dfsg1-1_armhf.deb ...
Unpacking libsuperlu-dev:armhf (6.0.1+dfsg1-1) ...
Selecting previously unselected package libarmadillo-dev.
Preparing to unpack .../080-libarmadillo-dev_1%3a12.6.7+dfsg-1_armhf.deb ...
Unpacking libarmadillo-dev (1:12.6.7+dfsg-1) ...
Selecting previously unselected package rapidjson-dev.
Preparing to unpack .../081-rapidjson-dev_1.1.0+dfsg2-7.1_all.deb ...
Unpacking rapidjson-dev (1.1.0+dfsg2-7.1) ...
Selecting previously unselected package libcereal-dev.
Preparing to unpack .../082-libcereal-dev_1.3.2+dfsg-4+rpi1_armhf.deb ...
Unpacking libcereal-dev (1.3.2+dfsg-4+rpi1) ...
Selecting previously unselected package libensmallen-dev.
Preparing to unpack .../083-libensmallen-dev_2.21.0-1_armhf.deb ...
Unpacking libensmallen-dev (2.21.0-1) ...
Selecting previously unselected package libexpat1-dev:armhf.
Preparing to unpack .../084-libexpat1-dev_2.5.0-2_armhf.deb ...
Unpacking libexpat1-dev:armhf (2.5.0-2) ...
Selecting previously unselected package libicu-dev:armhf.
Preparing to unpack .../085-libicu-dev_72.1-4_armhf.deb ...
Unpacking libicu-dev:armhf (72.1-4) ...
Selecting previously unselected package libjs-jquery.
Preparing to unpack .../086-libjs-jquery_3.6.1+dfsg+~3.5.14-1_all.deb ...
Unpacking libjs-jquery (3.6.1+dfsg+~3.5.14-1) ...
Selecting previously unselected package libjs-underscore.
Preparing to unpack .../087-libjs-underscore_1.13.4~dfsg+~1.11.4-3_all.deb ...
Unpacking libjs-underscore (1.13.4~dfsg+~1.11.4-3) ...
Selecting previously unselected package libjs-sphinxdoc.
Preparing to unpack .../088-libjs-sphinxdoc_7.2.6-3_all.deb ...
Unpacking libjs-sphinxdoc (7.2.6-3) ...
Selecting previously unselected package libpkgconf3:armhf.
Preparing to unpack .../089-libpkgconf3_1.8.1-1_armhf.deb ...
Unpacking libpkgconf3:armhf (1.8.1-1) ...
Selecting previously unselected package libpython3.11:armhf.
Preparing to unpack .../090-libpython3.11_3.11.7-2_armhf.deb ...
Unpacking libpython3.11:armhf (3.11.7-2) ...
Selecting previously unselected package libpython3.11-dev:armhf.
Preparing to unpack .../091-libpython3.11-dev_3.11.7-2_armhf.deb ...
Unpacking libpython3.11-dev:armhf (3.11.7-2) ...
Selecting previously unselected package libpython3-dev:armhf.
Preparing to unpack .../092-libpython3-dev_3.11.4-5_armhf.deb ...
Unpacking libpython3-dev:armhf (3.11.4-5) ...
Selecting previously unselected package libstb0:armhf.
Preparing to unpack .../093-libstb0_0.0~git20230129.5736b15+ds-1_armhf.deb ...
Unpacking libstb0:armhf (0.0~git20230129.5736b15+ds-1) ...
Selecting previously unselected package libstb-dev:armhf.
Preparing to unpack .../094-libstb-dev_0.0~git20230129.5736b15+ds-1_armhf.deb ...
Unpacking libstb-dev:armhf (0.0~git20230129.5736b15+ds-1) ...
Selecting previously unselected package libxml2-dev:armhf.
Preparing to unpack .../095-libxml2-dev_2.9.14+dfsg-1.3_armhf.deb ...
Unpacking libxml2-dev:armhf (2.9.14+dfsg-1.3) ...
Selecting previously unselected package pkgconf-bin.
Preparing to unpack .../096-pkgconf-bin_1.8.1-1_armhf.deb ...
Unpacking pkgconf-bin (1.8.1-1) ...
Selecting previously unselected package pkgconf:armhf.
Preparing to unpack .../097-pkgconf_1.8.1-1_armhf.deb ...
Unpacking pkgconf:armhf (1.8.1-1) ...
Selecting previously unselected package pkg-config:armhf.
Preparing to unpack .../098-pkg-config_1.8.1-1_armhf.deb ...
Unpacking pkg-config:armhf (1.8.1-1) ...
Selecting previously unselected package python3-six.
Preparing to unpack .../099-python3-six_1.16.0-4_all.deb ...
Unpacking python3-six (1.16.0-4) ...
Selecting previously unselected package python3-dateutil.
Preparing to unpack .../100-python3-dateutil_2.8.2-3_all.deb ...
Unpacking python3-dateutil (2.8.2-3) ...
Selecting previously unselected package python3.11-dev.
Preparing to unpack .../101-python3.11-dev_3.11.7-2_armhf.deb ...
Unpacking python3.11-dev (3.11.7-2) ...
Selecting previously unselected package python3-dev.
Preparing to unpack .../102-python3-dev_3.11.4-5_armhf.deb ...
Unpacking python3-dev (3.11.4-5) ...
Selecting previously unselected package python3-numpy.
Preparing to unpack .../103-python3-numpy_1%3a1.24.2-2_armhf.deb ...
Unpacking python3-numpy (1:1.24.2-2) ...
Selecting previously unselected package python3-tz.
Preparing to unpack .../104-python3-tz_2023.3.post1-2_all.deb ...
Unpacking python3-tz (2023.3.post1-2) ...
Selecting previously unselected package python3-pandas-lib:armhf.
Preparing to unpack .../105-python3-pandas-lib_1.5.3+dfsg-10_armhf.deb ...
Unpacking python3-pandas-lib:armhf (1.5.3+dfsg-10) ...
Selecting previously unselected package python3-pandas.
Preparing to unpack .../106-python3-pandas_1.5.3+dfsg-10_all.deb ...
Unpacking python3-pandas (1.5.3+dfsg-10) ...
Selecting previously unselected package python3-wheel.
Preparing to unpack .../107-python3-wheel_0.42.0-1_all.deb ...
Unpacking python3-wheel (0.42.0-1) ...
Selecting previously unselected package python3-pip.
Preparing to unpack .../108-python3-pip_23.3+dfsg-1_all.deb ...
Unpacking python3-pip (23.3+dfsg-1) ...
Selecting previously unselected package python3-pytest-runner.
Preparing to unpack .../109-python3-pytest-runner_2.11.1-4_all.deb ...
Unpacking python3-pytest-runner (2.11.1-4) ...
Selecting previously unselected package txt2man.
Preparing to unpack .../110-txt2man_1.7.1-4_all.deb ...
Unpacking txt2man (1.7.1-4) ...
Selecting previously unselected package sbuild-build-depends-main-dummy.
Preparing to unpack .../111-sbuild-build-depends-main-dummy_0.invalid.0_armhf.deb ...
Unpacking sbuild-build-depends-main-dummy (0.invalid.0) ...
Setting up media-types (10.1.0) ...
Setting up libpipeline1:armhf (1.5.7-1) ...
Setting up libpsl5:armhf (0.21.2-1+b1) ...
Setting up libicu72:armhf (72.1-4) ...
Setting up bsdextrautils (2.39.3-6) ...
Setting up hdf5-helpers (1.10.10+repack-3) ...
Setting up cpp-13 (13.2.0-9+rpi1) ...
Setting up libmagic-mgc (1:5.45-2) ...
Setting up gawk (1:5.2.1-2) ...
Setting up libarchive-zip-perl (1.68-1) ...
Setting up libdebhelper-perl (13.11.9) ...
Setting up libbrotli1:armhf (1.1.0-2) ...
Setting up libnghttp2-14:armhf (1.58.0-1) ...
Setting up libmagic1:armhf (1:5.45-2) ...
Setting up gettext-base (0.21-14) ...
Setting up m4 (1.4.19-4) ...
Setting up file (1:5.45-2) ...
Setting up libgomp1:armhf (13.2.0-9+rpi1) ...
Setting up libaec0:armhf (1.1.2-1) ...
Setting up rapidjson-dev (1.1.0+dfsg2-7.1) ...
Setting up autotools-dev (20220109.1) ...
Setting up libblas3:armhf (3.11.0-2) ...
update-alternatives: using /usr/lib/arm-linux-gnueabihf/blas/libblas.so.3 to provide /usr/lib/arm-linux-gnueabihf/libblas.so.3 (libblas.so.3-arm-linux-gnueabihf) in auto mode
Setting up libpkgconf3:armhf (1.8.1-1) ...
Setting up libuv1:armhf (1.46.0-2+rpi1) ...
Setting up libexpat1-dev:armhf (2.5.0-2) ...
Setting up libjpeg62-turbo:armhf (1:2.1.5-2) ...
Setting up libjpeg62-turbo-dev:armhf (1:2.1.5-2) ...
Setting up librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b2) ...
Setting up libproc2-0:armhf (2:4.0.4-2) ...
Setting up libssl-dev:armhf (3.1.4-2) ...
Setting up libstb0:armhf (0.0~git20230129.5736b15+ds-1) ...
Setting up autopoint (0.21-14) ...
Setting up libjsoncpp25:armhf (1.9.5-6) ...
Setting up icu-devtools (72.1-4) ...
Setting up pkgconf-bin (1.8.1-1) ...
Setting up libgfortran5:armhf (13.2.0-9+rpi1) ...
Setting up autoconf (2.71-3) ...
Setting up libubsan1:armhf (13.2.0-9+rpi1) ...
Setting up zlib1g-dev:armhf (1:1.3.dfsg-3) ...
Setting up libstb-dev:armhf (0.0~git20230129.5736b15+ds-1) ...
Setting up mount (2.39.3-6) ...
Setting up sensible-utils (0.0.20) ...
Setting up librhash0:armhf (1.4.3-3) ...
Setting up libasan8:armhf (13.2.0-9+rpi1) ...
Setting up libuchardet0:armhf (0.0.8-1) ...
Setting up procps (2:4.0.4-2) ...
Setting up libsub-override-perl (0.10-1) ...
Setting up libssh2-1:armhf (1.11.0-4) ...
Setting up netbase (6.4) ...
Setting up cmake-data (3.28.1-1) ...
Setting up libjs-jquery (3.6.1+dfsg+~3.5.14-1) ...
Setting up openssl (3.1.4-2) ...
Setting up libelf1:armhf (0.188-2.1+rpi1) ...
Setting up libicu-dev:armhf (72.1-4) ...
Setting up libxml2:armhf (2.9.14+dfsg-1.3) ...
Setting up libcc1-0:armhf (13.2.0-9+rpi1) ...
Setting up libblas-dev:armhf (3.11.0-2) ...
update-alternatives: using /usr/lib/arm-linux-gnueabihf/blas/libblas.so to provide /usr/lib/arm-linux-gnueabihf/libblas.so (libblas.so-arm-linux-gnueabihf) in auto mode
Setting up libsz2:armhf (1.1.2-1) ...
Setting up libjs-underscore (1.13.4~dfsg+~1.11.4-3) ...
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.13.1-1) ...
Setting up liblapack3:armhf (3.11.0-2) ...
update-alternatives: using /usr/lib/arm-linux-gnueabihf/lapack/liblapack.so.3 to provide /usr/lib/arm-linux-gnueabihf/liblapack.so.3 (liblapack.so.3-arm-linux-gnueabihf) in auto mode
Setting up gettext (0.21-14) ...
Setting up txt2man (1.7.1-4) ...
Setting up libtool (2.4.7-7) ...
Setting up libarchive13:armhf (3.7.2-1) ...
Setting up libpython3.11-stdlib:armhf (3.11.7-2) ...
Setting up libaec-dev:armhf (1.1.2-1) ...
Setting up libarpack2:armhf (3.9.1-1) ...
Setting up libjpeg-dev:armhf (1:2.1.5-2) ...
Setting up libcereal-dev (1.3.2+dfsg-4+rpi1) ...
Setting up libsuperlu6:armhf (6.0.1+dfsg1-1) ...
Setting up pkgconf:armhf (1.8.1-1) ...
Setting up intltool-debian (0.35.0+20060710.6) ...
Setting up dh-autoreconf (20) ...
Setting up ca-certificates (20230311) ...
Updating certificates in /etc/ssl/certs...
140 added, 0 removed; done.
Setting up libxml2-dev:armhf (2.9.14+dfsg-1.3) ...
Setting up liblapack-dev:armhf (3.11.0-2) ...
update-alternatives: using /usr/lib/arm-linux-gnueabihf/lapack/liblapack.so to provide /usr/lib/arm-linux-gnueabihf/liblapack.so (liblapack.so-arm-linux-gnueabihf) in auto mode
Setting up pkg-config:armhf (1.8.1-1) ...
Setting up libjs-sphinxdoc (7.2.6-3) ...
Setting up dh-strip-nondeterminism (1.13.1-1) ...
Setting up dwz (0.15-1) ...
Setting up libgcc-13-dev:armhf (13.2.0-9+rpi1) ...
Setting up groff-base (1.23.0-3) ...
Setting up libcurl4:armhf (8.5.0-2+rpi1) ...
Setting up libsuperlu-dev:armhf (6.0.1+dfsg1-1) ...
Setting up libarmadillo12 (1:12.6.7+dfsg-1) ...
Setting up libstdc++-13-dev:armhf (13.2.0-9+rpi1) ...
Setting up libpython3-stdlib:armhf (3.11.4-5) ...
Setting up python3.11 (3.11.7-2) ...
Setting up libarpack2-dev:armhf (3.9.1-1) ...
Setting up libpython3.11:armhf (3.11.7-2) ...
Setting up po-debconf (1.0.21+nmu1) ...
Setting up python3 (3.11.4-5) ...
Setting up man-db (2.12.0-1) ...
Not building database; man-db/auto-update is not 'true'.
Setting up python3-tz (2023.3.post1-2) ...
Setting up python3-six (1.16.0-4) ...
Setting up libcurl4-openssl-dev:armhf (8.5.0-2+rpi1) ...
Setting up libpython3.11-dev:armhf (3.11.7-2) ...
Setting up gcc-13 (13.2.0-9+rpi1) ...
Setting up cython3 (3.0.7-2) ...
Setting up libhdf5-103-1:armhf (1.10.10+repack-3) ...
Setting up libhdf5-cpp-103-1:armhf (1.10.10+repack-3) ...
Setting up cmake (3.28.1-1) ...
Setting up python3-dateutil (2.8.2-3) ...
Setting up python3-lib2to3 (3.11.5-1) ...
Setting up libhdf5-hl-100:armhf (1.10.10+repack-3) ...
Setting up python3-pkg-resources (68.1.2-2) ...
Setting up python3-distutils (3.11.5-1) ...
Setting up g++-13 (13.2.0-9+rpi1) ...
Setting up libpython3-dev:armhf (3.11.4-5) ...
Setting up python3-setuptools (68.1.2-2) ...
Setting up python3.11-dev (3.11.7-2) ...
Setting up debhelper (13.11.9) ...
Setting up python3-wheel (0.42.0-1) ...
Setting up libhdf5-hl-cpp-100:armhf (1.10.10+repack-3) ...
Setting up python3-dev (3.11.4-5) ...
Setting up libhdf5-fortran-102:armhf (1.10.10+repack-3) ...
Setting up python3-pip (23.3+dfsg-1) ...
Setting up python3-numpy (1:1.24.2-2) ...
Setting up libhdf5-hl-fortran-100:armhf (1.10.10+repack-3) ...
Setting up python3-pytest-runner (2.11.1-4) ...
Setting up dh-python (6.20231223) ...
Setting up python3-pandas-lib:armhf (1.5.3+dfsg-10) ...
Setting up python3-pandas (1.5.3+dfsg-10) ...
Setting up libhdf5-dev (1.10.10+repack-3) ...
update-alternatives: using /usr/lib/arm-linux-gnueabihf/pkgconfig/hdf5-serial.pc to provide /usr/lib/arm-linux-gnueabihf/pkgconfig/hdf5.pc (hdf5.pc) in auto mode
Setting up libarmadillo-dev (1:12.6.7+dfsg-1) ...
Setting up libensmallen-dev (2.21.0-1) ...
Setting up sbuild-build-depends-main-dummy (0.invalid.0) ...
Processing triggers for libc-bin (2.37-12+rpi2) ...
Processing triggers for ca-certificates (20230311) ...
Updating certificates in /etc/ssl/certs...
0 added, 0 removed; done.
Running hooks in /etc/ca-certificates/update.d...
done.
+------------------------------------------------------------------------------+
| Check architectures |
+------------------------------------------------------------------------------+
Arch check ok (armhf included in any all)
+------------------------------------------------------------------------------+
| Build environment |
+------------------------------------------------------------------------------+
Kernel: Linux 6.1.47-v8+ #1 SMP PREEMPT Fri Sep 1 07:05:33 BST 2023 arm64 (aarch64)
Toolchain package versions: binutils_2.41-6+rpi1 dpkg-dev_1.22.1+rpi1 g++-12_12.3.0-13+rpi1 g++-13_13.2.0-9+rpi1 gcc-12_12.3.0-13+rpi1 gcc-13_13.2.0-9+rpi1 libc6-dev_2.37-12+rpi2 libstdc++-12-dev_12.3.0-13+rpi1 libstdc++-13-dev_13.2.0-9+rpi1 libstdc++6_13.2.0-9+rpi1 linux-libc-dev_6.5.6-1+rpi1
Package versions: adduser_3.137 apt_2.7.6 autoconf_2.71-3 automake_1:1.16.5-1.3 autopoint_0.21-14 autotools-dev_20220109.1 base-files_13+rpi1 base-passwd_3.6.3 bash_5.2.21-2 binutils_2.41-6+rpi1 binutils-arm-linux-gnueabihf_2.41-6+rpi1 binutils-common_2.41-6+rpi1 bsdextrautils_2.39.3-6 bsdutils_1:2.39.3-6 build-essential_12.10 bzip2_1.0.8-5+b2 ca-certificates_20230311 cmake_3.28.1-1 cmake-data_3.28.1-1 coreutils_9.1-1 cpp_4:13.2.0-1+rpi1 cpp-12_12.3.0-13+rpi1 cpp-13_13.2.0-9+rpi1 cython3_3.0.7-2 dash_0.5.12-6 debconf_1.5.82 debhelper_13.11.9 debianutils_5.14 dh-autoreconf_20 dh-python_6.20231223 dh-strip-nondeterminism_1.13.1-1 diffutils_1:3.10-1 dirmngr_2.2.40-1.1 dpkg_1.22.1+rpi1 dpkg-dev_1.22.1+rpi1 dwz_0.15-1 e2fsprogs_1.47.0-2 fakeroot_1.32.2-1 file_1:5.45-2 findutils_4.9.0-5 g++_4:13.2.0-1+rpi1 g++-12_12.3.0-13+rpi1 g++-13_13.2.0-9+rpi1 gawk_1:5.2.1-2 gcc_4:13.2.0-1+rpi1 gcc-10-base_10.4.0-7+rpi1 gcc-12_12.3.0-13+rpi1 gcc-12-base_12.3.0-13+rpi1 gcc-13_13.2.0-9+rpi1 gcc-13-base_13.2.0-9+rpi1 gcc-7-base_7.5.0-6+rpi1+b2 gcc-8-base_8.4.0-7+rpi1 gcc-9-base_9.4.0-2+rpi1 gettext_0.21-14 gettext-base_0.21-14 gnupg_2.2.40-1.1 gnupg-l10n_2.2.40-1.1 gnupg-utils_2.2.40-1.1 gpg_2.2.40-1.1 gpg-agent_2.2.40-1.1 gpg-wks-client_2.2.40-1.1 gpg-wks-server_2.2.40-1.1 gpgconf_2.2.40-1.1 gpgsm_2.2.40-1.1 gpgv_2.2.40-1.1 grep_3.11-3 groff-base_1.23.0-3 gzip_1.12-1 hdf5-helpers_1.10.10+repack-3 hostname_3.23+nmu1 icu-devtools_72.1-4 init-system-helpers_1.66 intltool-debian_0.35.0+20060710.6 libacl1_2.3.1-3 libaec-dev_1.1.2-1 libaec0_1.1.2-1 libapt-pkg6.0_2.7.6 libarchive-zip-perl_1.68-1 libarchive13_3.7.2-1 libarmadillo-dev_1:12.6.7+dfsg-1 libarmadillo12_1:12.6.7+dfsg-1 libarpack2_3.9.1-1 libarpack2-dev_3.9.1-1 libasan8_13.2.0-9+rpi1 libassuan0_2.5.6-1 libatomic1_13.2.0-9+rpi1 libattr1_1:2.5.1-4 libaudit-common_1:3.1.2-1 libaudit1_1:3.1.2-1 libbinutils_2.41-6+rpi1 libblas-dev_3.11.0-2 libblas3_3.11.0-2 libblkid1_2.39.3-6 libbrotli1_1.1.0-2 libbz2-1.0_1.0.8-5+b2 libc-bin_2.37-12+rpi2 libc-dev-bin_2.37-12+rpi2 libc6_2.37-12+rpi2 libc6-dev_2.37-12+rpi2 libcap-ng0_0.8.3-3 libcap2_1:2.66-4 libcc1-0_13.2.0-9+rpi1 libcereal-dev_1.3.2+dfsg-4+rpi1 libcom-err2_1.47.0-2 libcrypt-dev_1:4.4.36-2 libcrypt1_1:4.4.36-2 libctf-nobfd0_2.41-6+rpi1 libctf0_2.41-6+rpi1 libcurl4_8.5.0-2+rpi1 libcurl4-openssl-dev_8.5.0-2+rpi1 libdb5.3_5.3.28+dfsg2-4 libdebconfclient0_0.271 libdebhelper-perl_13.11.9 libdpkg-perl_1.22.1+rpi1 libelf1_0.188-2.1+rpi1 libensmallen-dev_2.21.0-1 libexpat1_2.5.0-2 libexpat1-dev_2.5.0-2 libext2fs2_1.47.0-2 libfakeroot_1.32.2-1 libffi8_3.4.4-2 libfile-find-rule-perl_0.34-3 libfile-stripnondeterminism-perl_1.13.1-1 libgcc-12-dev_12.3.0-13+rpi1 libgcc-13-dev_13.2.0-9+rpi1 libgcc-s1_13.2.0-9+rpi1 libgcrypt20_1.10.3-2 libgdbm-compat4_1.23-5 libgdbm6_1.23-5 libgfortran5_13.2.0-9+rpi1 libgmp10_2:6.3.0+dfsg-2 libgnutls30_3.8.2-1 libgomp1_13.2.0-9+rpi1 libgpg-error0_1.47-3 libgssapi-krb5-2_1.20.1-5 libhdf5-103-1_1.10.10+repack-3 libhdf5-cpp-103-1_1.10.10+repack-3 libhdf5-dev_1.10.10+repack-3 libhdf5-fortran-102_1.10.10+repack-3 libhdf5-hl-100_1.10.10+repack-3 libhdf5-hl-cpp-100_1.10.10+repack-3 libhdf5-hl-fortran-100_1.10.10+repack-3 libhogweed6_3.9.1-2 libicu-dev_72.1-4 libicu72_72.1-4 libidn2-0_2.3.4-1 libisl23_0.26-3 libjansson4_2.14-2 libjpeg-dev_1:2.1.5-2 libjpeg62-turbo_1:2.1.5-2 libjpeg62-turbo-dev_1:2.1.5-2 libjs-jquery_3.6.1+dfsg+~3.5.14-1 libjs-sphinxdoc_7.2.6-3 libjs-underscore_1.13.4~dfsg+~1.11.4-3 libjsoncpp25_1.9.5-6 libk5crypto3_1.20.1-5 libkeyutils1_1.6.3-2 libkrb5-3_1.20.1-5 libkrb5support0_1.20.1-5 libksba8_1.6.5-2 liblapack-dev_3.11.0-2 liblapack3_3.11.0-2 libldap-2.5-0_2.5.13+dfsg-5+rpi1 liblocale-gettext-perl_1.07-6 liblz4-1_1.9.4-1+rpi1+b1 liblzma5_5.4.5-0.1 libmagic-mgc_1:5.45-2 libmagic1_1:5.45-2 libmd0_1.1.0-1 libmount1_2.39.3-6 libmpc3_1.3.1-1 libmpfr6_4.2.1-1 libncursesw6_6.4+20231209-1 libnettle8_3.9.1-2 libnghttp2-14_1.58.0-1 libnpth0_1.6-3 libnsl-dev_1.3.0-3 libnsl2_1.3.0-3 libnumber-compare-perl_0.03-3 libp11-kit0_0.25.3-2 libpam-modules_1.5.2-9.1 libpam-modules-bin_1.5.2-9.1 libpam-runtime_1.5.2-9.1 libpam0g_1.5.2-9.1 libpcre2-8-0_10.42-4 libperl5.36_5.36.0-10 libpipeline1_1.5.7-1 libpkgconf3_1.8.1-1 libproc2-0_2:4.0.4-2 libpsl5_0.21.2-1+b1 libpython3-dev_3.11.4-5 libpython3-stdlib_3.11.4-5 libpython3.11_3.11.7-2 libpython3.11-dev_3.11.7-2 libpython3.11-minimal_3.11.7-2 libpython3.11-stdlib_3.11.7-2 libreadline8_8.2-3 librhash0_1.4.3-3 librtmp1_2.4+20151223.gitfa8646d.1-2+b2 libsasl2-2_2.1.28+dfsg1-4 libsasl2-modules-db_2.1.28+dfsg1-4 libseccomp2_2.5.4-2+rpi1 libselinux1_3.5-1 libsemanage-common_3.5-1 libsemanage2_3.5-1 libsepol2_3.5-2 libsframe1_2.41-6+rpi1 libsigsegv2_2.14-1 libsmartcols1_2.39.3-6 libsqlite3-0_3.44.2-1 libss2_1.47.0-2 libssh2-1_1.11.0-4 libssl-dev_3.1.4-2 libssl3_3.1.4-2 libstb-dev_0.0~git20230129.5736b15+ds-1 libstb0_0.0~git20230129.5736b15+ds-1 libstdc++-12-dev_12.3.0-13+rpi1 libstdc++-13-dev_13.2.0-9+rpi1 libstdc++6_13.2.0-9+rpi1 libsub-override-perl_0.10-1 libsuperlu-dev_6.0.1+dfsg1-1 libsuperlu6_6.0.1+dfsg1-1 libsystemd0_254.5-1+rpi1 libsz2_1.1.2-1 libtasn1-6_4.19.0-3 libtext-charwidth-perl_0.04-11 libtext-glob-perl_0.11-3 libtext-iconv-perl_1.7-8 libtinfo6_6.4+20231209-1 libtirpc-common_1.3.4+ds-1 libtirpc-dev_1.3.4+ds-1 libtirpc3_1.3.4+ds-1 libtool_2.4.7-7 libubsan1_13.2.0-9+rpi1 libuchardet0_0.0.8-1 libudev1_254.5-1+rpi1 libunistring5_1.1-2 libuuid1_2.39.3-6 libuv1_1.46.0-2+rpi1 libxml2_2.9.14+dfsg-1.3 libxml2-dev_2.9.14+dfsg-1.3 libxxhash0_0.8.2-2 libzstd1_1.5.5+dfsg2-2 linux-libc-dev_6.5.6-1+rpi1 login_1:4.13+dfsg1-3 logsave_1.47.0-2 lsb-base_11.6+rpi1 m4_1.4.19-4 make_4.3-4.1 man-db_2.12.0-1 mawk_1.3.4.20231126-1 media-types_10.1.0 mount_2.39.3-6 nano_7.2-1 ncurses-base_6.4+20231209-1 ncurses-bin_6.4+20231209-1 netbase_6.4 openssl_3.1.4-2 passwd_1:4.13+dfsg1-3 patch_2.7.6-7 perl_5.36.0-10 perl-base_5.36.0-10 perl-modules-5.36_5.36.0-10 pinentry-curses_1.2.1-3 pkg-config_1.8.1-1 pkgconf_1.8.1-1 pkgconf-bin_1.8.1-1 po-debconf_1.0.21+nmu1 procps_2:4.0.4-2 python3_3.11.4-5 python3-dateutil_2.8.2-3 python3-dev_3.11.4-5 python3-distutils_3.11.5-1 python3-lib2to3_3.11.5-1 python3-minimal_3.11.4-5 python3-numpy_1:1.24.2-2 python3-pandas_1.5.3+dfsg-10 python3-pandas-lib_1.5.3+dfsg-10 python3-pip_23.3+dfsg-1 python3-pkg-resources_68.1.2-2 python3-pytest-runner_2.11.1-4 python3-setuptools_68.1.2-2 python3-six_1.16.0-4 python3-tz_2023.3.post1-2 python3-wheel_0.42.0-1 python3.11_3.11.7-2 python3.11-dev_3.11.7-2 python3.11-minimal_3.11.7-2 rapidjson-dev_1.1.0+dfsg2-7.1 raspbian-archive-keyring_20120528.2 readline-common_8.2-3 rpcsvc-proto_1.4.3-1 sbuild-build-depends-main-dummy_0.invalid.0 sed_4.9-1 sensible-utils_0.0.20 sysvinit-utils_3.08-5 tar_1.34+dfsg-1.3 txt2man_1.7.1-4 tzdata_2023c-11 usr-is-merged_38 usrmerge_38 util-linux_2.39.3-6 xz-utils_5.4.5-0.1 zlib1g_1:1.3.dfsg-3 zlib1g-dev_1:1.3.dfsg-3
+------------------------------------------------------------------------------+
| Build |
+------------------------------------------------------------------------------+
Unpack source
-------------
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA512
Format: 3.0 (quilt)
Source: mlpack
Binary: libmlpack-dev, python3-mlpack, mlpack-bin, mlpack-doc
Architecture: any all
Version: 4.3.0-2
Maintainer: Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net>
Uploaders: Barak A. Pearlmutter <bap@debian.org>
Homepage: https://www.mlpack.org/
Standards-Version: 4.6.2
Vcs-Browser: https://salsa.debian.org/science-team/mlpack
Vcs-Git: https://salsa.debian.org/science-team/mlpack.git
Build-Depends: cmake, debhelper-compat (= 13), pkg-config, libcereal-dev, libxml2-dev, libarmadillo-dev, libensmallen-dev (>= 2.10.0), libstb-dev, dh-python, dh-sequence-python3, python3, python3-dev, python3-pandas, python3-numpy, cython3, python3-setuptools, python3-pytest-runner, python3-pip, txt2man
Package-List:
libmlpack-dev deb libdevel optional arch=any
mlpack-bin deb science optional arch=any
mlpack-doc deb doc optional arch=all
python3-mlpack deb python optional arch=any
Checksums-Sha1:
6042d410fc33671fe00e595235372065bab2f225 4957320 mlpack_4.3.0.orig.tar.xz
92bbafbed504e77d072a29e93bd72d0a240efa4b 11276 mlpack_4.3.0-2.debian.tar.xz
Checksums-Sha256:
0d3b230892a35a5250d5e94e29c8e0bbf8d855de89aa2d1ded201decb6c45ad6 4957320 mlpack_4.3.0.orig.tar.xz
642d79a55aad4f7c06e4342e65df9af6a2a2244a9ef335b34ec321e1af83e1bc 11276 mlpack_4.3.0-2.debian.tar.xz
Files:
40b46c5b40be70cc2aff8c11f69d1c8a 4957320 mlpack_4.3.0.orig.tar.xz
326b50d08f1f7d70b751b50b569ecf5c 11276 mlpack_4.3.0-2.debian.tar.xz
-----BEGIN PGP SIGNATURE-----
iQIzBAEBCgAdFiEEJeP/LX9Gnb59DU5Qr8/sjmac4cIFAmWfuIoACgkQr8/sjmac
4cJVzA/9HJGz1IJfYWcP69MBhlpHWfKwi/HC5EZgTuw7O8Ed45KO80xHTPuatL00
VWODIEP0aWbS2HzfhPzQPbM1xtt0J58TfWp0fzxGvKnrKdX1jFq0G/ZStVyn573Z
0FeuHY9wPV9sIyFQq+5GPuSD3vJyM59+t1OfXtTJdhQBQa2gdLDmWnE3QPxelEyq
zBEn4H84LQVKnK8lL3ceFM5wRL2VuICp9yxuunFq5HMOFpH8zYe+S+a1ZJJhFS+O
0msTEjOiENGv95jTSPM3POLhKajeHi1uuQMkY82BeU+ktw9ylKs4f2sIUnz9IRHq
pp7bJEWEN0o6lIHF9550QoSWvFCONIvAMyctDcS1kmRrhEDTZaTrrHx7cZRtjK9u
BCayPsSu1U+qy3Wbv3udYAYYfF8zbmkEoOsYUP2O8hdSE7fVoTNoyeXOBv/lEsKd
70/itMIkSe4jfbnGCXhGWGfE6vENKWsLfa+yCoujSo1yN1/c0aaudTGTLRkRAACx
5m4TjUbbJmAIW/Xqh6K84JLUvaugefhp4rzm/PfpwxZEsQSUKB9Nh915cyMsPEpQ
dKqGMQkFZ2KPqS4sGOoVIfPLWQs9aw5j+CG2cE0/OQ1fXbtAAchnyYfGmsbSuKq/
94baGiURVMDF98Yl4cfifsuaIvCbTvwRFhmYGucBMNjaT8K4Vvk=
=iYxS
-----END PGP SIGNATURE-----
gpgv: Signature made Thu Jan 11 09:44:42 2024 UTC
gpgv: using RSA key 25E3FF2D7F469DBE7D0D4E50AFCFEC8E669CE1C2
gpgv: Can't check signature: No public key
dpkg-source: warning: cannot verify inline signature for ./mlpack_4.3.0-2.dsc: no acceptable signature found
dpkg-source: info: extracting mlpack in /<<PKGBUILDDIR>>
dpkg-source: info: unpacking mlpack_4.3.0.orig.tar.xz
dpkg-source: info: unpacking mlpack_4.3.0-2.debian.tar.xz
dpkg-source: info: using patch list from debian/patches/series
dpkg-source: info: applying 0001-do-not-disable-optimization.patch
dpkg-source: info: applying no-runtime-cython.patch
Check disk space
----------------
Sufficient free space for build
User Environment
----------------
APT_CONFIG=/var/lib/sbuild/apt.conf
DEB_BUILD_OPTIONS=parallel=4
HOME=/sbuild-nonexistent
LANG=en_GB.UTF-8
LC_ALL=C.UTF-8
LOGNAME=buildd
PATH=/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games
SCHROOT_ALIAS_NAME=trixie-staging-armhf-sbuild
SCHROOT_CHROOT_NAME=trixie-staging-armhf-sbuild
SCHROOT_COMMAND=env
SCHROOT_GID=124
SCHROOT_GROUP=buildd
SCHROOT_SESSION_ID=trixie-staging-armhf-sbuild-b8df786b-973b-4d43-8bc9-8fc5a3465d34
SCHROOT_UID=114
SCHROOT_USER=buildd
SHELL=/bin/sh
USER=buildd
dpkg-buildpackage
-----------------
Command: dpkg-buildpackage --sanitize-env -us -uc -mRaspbian pi5 test autobuilder <root@raspbian.org> -B -rfakeroot
dpkg-buildpackage: info: source package mlpack
dpkg-buildpackage: info: source version 4.3.0-2
dpkg-buildpackage: info: source distribution unstable
dpkg-source --before-build .
dpkg-buildpackage: info: host architecture armhf
debian/rules clean
dh clean --without python2 --with python3 --buildsystem=cmake --max-parallel=1
dh_auto_clean -O--buildsystem=cmake -O--max-parallel=1
dh_autoreconf_clean -O--buildsystem=cmake -O--max-parallel=1
dh_clean -O--buildsystem=cmake -O--max-parallel=1
debian/rules binary-arch
dh binary-arch --without python2 --with python3 --buildsystem=cmake --max-parallel=1
dh_update_autotools_config -a -O--buildsystem=cmake -O--max-parallel=1
dh_autoreconf -a -O--buildsystem=cmake -O--max-parallel=1
debian/rules override_dh_auto_configure
make[1]: Entering directory '/<<PKGBUILDDIR>>'
dh_auto_configure -- -DCMAKE_LIBRARY_PATH=arm-linux-gnueabihf \
-DDEBUG=ON \
-DPROFILE=OFF \
-DARMA_EXTRA_DEBUG=OFF \
-DBUILD_CLI_EXECUTABLES=ON \
-DBUILD_PYTHON_BINDINGS=ON \
-DPYTHON_EXECUTABLE=/usr/bin/python3 \
-DBUILD_JULIA_BINDINGS=OFF \
-DBUILD_GO_BINDINGS=OFF \
-DBUILD_R_BINDINGS=OFF \
-DBUILD_TESTS=OFF \
-DBUILD_SHARED_LIBS=ON \
-DDISABLE_DOWNLOADS=ON \
-DSTB_IMAGE_INCLUDE_DIR=/usr/include/stb \
-DUSE_OPENMP=ON
cd obj-arm-linux-gnueabihf && DEB_PYTHON_INSTALL_LAYOUT=deb 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 -DCMAKE_LIBRARY_PATH=arm-linux-gnueabihf -DDEBUG=ON -DPROFILE=OFF -DARMA_EXTRA_DEBUG=OFF -DBUILD_CLI_EXECUTABLES=ON -DBUILD_PYTHON_BINDINGS=ON -DPYTHON_EXECUTABLE=/usr/bin/python3 -DBUILD_JULIA_BINDINGS=OFF -DBUILD_GO_BINDINGS=OFF -DBUILD_R_BINDINGS=OFF -DBUILD_TESTS=OFF -DBUILD_SHARED_LIBS=ON -DDISABLE_DOWNLOADS=ON -DSTB_IMAGE_INCLUDE_DIR=/usr/include/stb -DUSE_OPENMP=ON ..
-- The C compiler identification is GNU 13.2.0
-- The CXX compiler identification is GNU 13.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
CMake Deprecation Warning at CMake/cotire.cmake:40 (cmake_minimum_required):
Compatibility with CMake < 3.5 will be removed from a future version of
CMake.
Update the VERSION argument <min> value or use a ...<max> suffix to tell
CMake that the project does not need compatibility with older versions.
Call Stack (most recent call first):
CMakeLists.txt:4 (include)
-- cotire 1.7.10 loaded.
-- Performing Test HAVE_CXX_ATOMICS64_WITHOUT_LIB
-- Performing Test HAVE_CXX_ATOMICS64_WITHOUT_LIB - Failed
-- Looking for __atomic_load_8 in atomic
-- Looking for __atomic_load_8 in atomic - found
-- Performing Test HAVE_CXX_ATOMICS64_WITH_LIB
-- Performing Test HAVE_CXX_ATOMICS64_WITH_LIB - Success
-- Performing Test CMAKE_HAVE_LIBC_PTHREAD
-- Performing Test CMAKE_HAVE_LIBC_PTHREAD - Success
-- Found Threads: TRUE
CMake Warning (dev) at /usr/share/cmake-3.28/Modules/FindPackageHandleStandardArgs.cmake:438 (message):
The package name passed to `find_package_handle_standard_args` (LIBBFD)
does not match the name of the calling package (Bfd). This can lead to
problems in calling code that expects `find_package` result variables
(e.g., `_FOUND`) to follow a certain pattern.
Call Stack (most recent call first):
CMake/FindBfd.cmake:82 (FIND_PACKAGE_HANDLE_STANDARD_ARGS)
CMakeLists.txt:236 (find_package)
This warning is for project developers. Use -Wno-dev to suppress it.
-- Could NOT find LIBBFD (missing: LIBBFD_BFD_LIBRARY LIBBFD_INCLUDE_DIRS)
-- Found LibDL: /usr/lib/arm-linux-gnueabihf/libdl.a
-- Performing Test LIBDL_NEEDS_UNDERSCORE
-- Performing Test LIBDL_NEEDS_UNDERSCORE - Failed
CMake Warning at CMakeLists.txt:246 (message):
No libBFD and/or libDL has been found!
-- Found Armadillo: /usr/lib/libarmadillo.so (found suitable version "12.6.7", minimum required is "9.800")
-- Found StbImage: /usr/include/stb
-- Check that STB static implementation mode links correctly...
-- Check that STB static implementation mode links correctly... success
-- Found Ensmallen: /usr/include (found suitable version "2.20.0", minimum required is "2.10.0")
-- Found cereal: /usr/include (found suitable version "1.3.2", minimum required is "1.1.2")
-- Found OpenMP_C: -fopenmp (found version "4.5")
-- Found OpenMP_CXX: -fopenmp (found version "4.5")
-- Found OpenMP: TRUE (found version "4.5")
-- Could NOT find Git (missing: GIT_EXECUTABLE)
-- Not building Julia bindings.
-- Not building Markdown bindings.
CMake Warning (dev) at src/mlpack/bindings/python/CMakeLists.txt:53 (find_package):
Policy CMP0148 is not set: The FindPythonInterp and FindPythonLibs modules
are removed. Run "cmake --help-policy CMP0148" for policy details. Use
the cmake_policy command to set the policy and suppress this warning.
This warning is for project developers. Use -Wno-dev to suppress it.
-- Found PythonInterp: /usr/bin/python3 (found version "3.11.7")
-- Found PY_distutils: /usr/lib/python3/dist-packages/setuptools/_distutils
<string>:1: DeprecationWarning: distutils Version classes are deprecated. Use packaging.version instead.
-- Found PY_Cython: /usr/lib/python3/dist-packages/Cython
-- Found PY_numpy: /usr/lib/python3/dist-packages/numpy
<string>:1: DeprecationWarning: distutils Version classes are deprecated. Use packaging.version instead.
-- Found PY_pandas: /usr/lib/python3/dist-packages/pandas
-- Found PY_wheel: /usr/lib/python3/dist-packages/wheel
-- Not building Go bindings.
-- Not building R bindings.
-- Found PkgConfig: /usr/bin/pkg-config (found version "1.8.1")
-- Configuring done (4.9s)
-- Generating done (0.3s)
CMake Warning:
Manually-specified variables were not used by the project:
CMAKE_EXPORT_NO_PACKAGE_REGISTRY
CMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY
DISABLE_DOWNLOADS
FETCHCONTENT_FULLY_DISCONNECTED
-- Build files have been written to: /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
dh_auto_build -a -O--buildsystem=cmake -O--max-parallel=1
cd obj-arm-linux-gnueabihf && make -j1 "INSTALL=install --strip-program=true" VERBOSE=1
make[1]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/CMakeFiles /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf//CMakeFiles/progress.marks
make -f CMakeFiles/Makefile2 all
make[2]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_range_search.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_range_search.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_range_search.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_range_search.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_range_search.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 1%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_range_search.dir/range_search/range_search_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_range_search.dir/range_search/range_search_main.cpp.o -MF CMakeFiles/mlpack_range_search.dir/range_search/range_search_main.cpp.o.d -o CMakeFiles/mlpack_range_search.dir/range_search/range_search_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:14:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp: In function ‘void range_search(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:174:22: warning: ‘new’ of type ‘mlpack::RSModel’ with extended alignment 16 [-Waligned-new=]
174 | rs = new RSModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:174:22: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:174:22: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search.hpp:327,
from /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:21:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:117:67: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
78 | referenceSet(naive ? new MatType() : NULL), // Empty matrix.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:121:55: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:125:59: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:133:55: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:137:62: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:141:59: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:145:63: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:113:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:129:66: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:149:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::RPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:153:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::MaxRPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::MaxRPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:157:67: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:161:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:165:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::RSModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::RSModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::RSModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:88:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::RSModel’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree.hpp:580,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, ElemType) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = CoverTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, FirstPointIsRoot>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:117:67: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
239 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp:638,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:20,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:22:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:121:55: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RStarTreeSplit, RStarTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:125:59: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:26:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:129:66: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, XTreeSplit, RTreeDescentHeuristic, XTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:133:55: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:137:62: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:141:59: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:145:63: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:149:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:161:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:113:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:129:66: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:149:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, RPTreeMeanSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::RPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:153:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, RPTreeMaxSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::MaxRPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::MaxRPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:157:67: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:161:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree.hpp:468,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:21:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = Octree<LMetric<2, true>, RangeSearchStat, arma::Mat<double> >; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:165:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
192 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:129:66: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp:296,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:35:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:30:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:111:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:137:62: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
46 | new arma::Col<HilbertElemType>(tree->Dataset().n_rows)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
61 | localHilbertValues = new arma::Mat<HilbertElemType>(tree->Dataset().n_rows,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
62 | tree->MaxLeafSize() + 1);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:149:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:168:44: required from ‘mlpack::LeafSizeRSWrapper<TreeType>::LeafSizeRSWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:161:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp:38:22: required from ‘static void mlpack::RTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:121:55: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split_impl.hpp:34:22: required from ‘static void mlpack::HilbertRTreeSplit<splitOrder>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; unsigned int splitOrder = 2]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:137:62: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp:60:22: required from ‘static void mlpack::RPlusTreeSplit<SplitPolicyType, SweepType>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicyType = mlpack::RPlusTreeSplitPolicy; SweepType = mlpack::MinimalCoverageSweep]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:141:59: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp:60:22: required from ‘static void mlpack::RPlusTreeSplit<SplitPolicyType, SweepType>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicyType = mlpack::RPlusPlusTreeSplitPolicy; SweepType = mlpack::MinimalSplitsNumberSweep]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:145:63: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const mlpack::DiscreteHilbertValue<TreeElemType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:40:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:191:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split_impl.hpp:34:22: required from ‘static void mlpack::HilbertRTreeSplit<splitOrder>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; unsigned int splitOrder = 2]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:93:7: required from ‘mlpack::RSWrapper<TreeType>::RSWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:137:62: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
83 | localHilbertValues = new arma::Mat<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
84 | *other.LocalHilbertValues());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
90 | valueToInsert = new arma::Col<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
91 | *other.ValueToInsert());
| ~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree() [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>]’:
/usr/include/cereal/access.hpp:317:16: required from ‘static T* cereal::access::construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >]’
/usr/include/cereal/details/traits.hpp:1364:46: required from ‘static T* cereal::detail::Construct<T, A, false, false, false, false>::load_andor_construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >; A = cereal::BinaryInputArchive]’
/usr/include/cereal/types/memory.hpp:411:101: required from ‘typename std::enable_if<(! cereal::traits::has_load_and_construct<T, Archive>::value), void>::type cereal::load(Archive&, memory_detail::PtrWrapper<std::unique_ptr<T, D>&>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > >; typename std::enable_if<(! traits::has_load_and_construct<T, Archive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/types/memory.hpp:253:7: required from ‘typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type cereal::load(Archive&, std::unique_ptr<T, D>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > >; typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/cereal/pointer_wrapper.hpp:65:7: required from ‘void cereal::PointerWrapper<T>::load(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:287:43: required from ‘static decltype (t.load(ar, version)) cereal::access::member_load(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > >; decltype (t.load(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1058:28: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > >; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> > >}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:672:7: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:200:7: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; TreeType = mlpack::Octree; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::LeafSizeRSWrapper<mlpack::Octree>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::LeafSizeRSWrapper<mlpack::Octree>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::LeafSizeRSWrapper<mlpack::Octree>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::LeafSizeRSWrapper<mlpack::Octree>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::LeafSizeRSWrapper<mlpack::Octree>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::LeafSizeRSWrapper<mlpack::Octree>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::LeafSizeRSWrapper<mlpack::Octree>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::LeafSizeRSWrapper<mlpack::Octree>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:542:11: required from ‘void mlpack::RSModel::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::RSModel; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::RSModel; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::RSModel&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::RSModel&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::RSModel&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::RSModel&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::RSModel&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::RSModel&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/data/load_model_impl.hpp:95:9: required from ‘bool mlpack::data::Load(const std::string&, const std::string&, T&, bool, format) [with T = mlpack::RSModel; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:124:15: required from ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::RSModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::RSModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::RSModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:88:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
475 | dataset(new MatType()),
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:393,
from /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_main.cpp:22:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp: In instantiation of ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: warning: ‘new’ of type ‘mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::UBTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’} with extended alignment 16 [-Waligned-new=]
365 | new typename decltype(rs)::Tree(std::move(referenceSet),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
366 | oldFromNewReferences,
| ~~~~~~~~~~~~~~~~~~~~~
367 | leafSize);
| ~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp: In instantiation of ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::VPTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: warning: ‘new’ of type ‘mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::VPTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’} with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp: In instantiation of ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: warning: ‘new’ of type ‘mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:365:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:358:13: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
154 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: warning: ‘new’ of type ‘mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::UBTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’} with extended alignment 16 [-Waligned-new=]
104 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:358:13: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::MaxRPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:358:13: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::MaxRPTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::MaxRPTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::RPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:358:13: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RPTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::RPTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: warning: ‘new’ of type ‘mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::VPTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’} with extended alignment 16 [-Waligned-new=]
104 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:358:13: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::VPTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::VPTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:302:11: required from ‘void mlpack::RSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RPlusPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:120:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:302:11: required from ‘void mlpack::RSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:120:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:302:11: required from ‘void mlpack::RSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::HilbertRTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:120:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:302:11: required from ‘void mlpack::RSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::XTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:120:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: warning: ‘new’ of type ‘mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
104 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:358:13: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:302:11: required from ‘void mlpack::RSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RStarTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:120:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:302:11: required from ‘void mlpack::RSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:120:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:302:11: required from ‘void mlpack::RSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:120:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:358:13: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const mlpack::Octree<MetricType, StatisticType, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
348 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::MaxRPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::RPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::VPTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::VPTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::VPTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:321:33: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::RSWrapper<TreeType>* mlpack::RSWrapper<TreeType>::Clone() const [with TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:100:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
509 | new MatType(*other.dataset) : other.dataset),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:88:7: required from ‘mlpack::LeafSizeRSWrapper<TreeType>* mlpack::LeafSizeRSWrapper<TreeType>::Clone() const [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:177:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = Octree<LMetric<2, true>, RangeSearchStat, arma::Mat<double> >; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
66 | dataset(new MatType(dataset)),
| ^~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, RPTreeMaxSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::MaxRPTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, RPTreeMeanSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::RPTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::VPTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:331:14: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::RPlusPlusTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:331:14: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::RPlusTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:331:14: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::HilbertRTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, XTreeSplit, RTreeDescentHeuristic, XTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:331:14: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::XTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RStarTreeSplit, RStarTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:331:14: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::RStarTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:331:14: required from ‘void mlpack::RSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::RTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:126:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model_impl.hpp:418:14: required from ‘void mlpack::LeafSizeRSWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&, size_t) [with TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; mlpack::Range = mlpack::RangeType<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/rs_model.hpp:189:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<double*, vector<double> >; _Distance = int; _Tp = double; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/string:51,
from /usr/include/c++/13/stdexcept:39,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:34:
/usr/include/c++/13/bits/stl_algobase.h: In function ‘void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >]’:
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Distance = int; _Tp = pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1942 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:497:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:658:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Distance = int; _Tp = pair<arma::Col<long long unsigned int>, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1910:25,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/bits/stl_algo.h:1635:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1635 | std::__make_heap(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1911:23,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/bits/stl_heap.h:425:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
425 | std::__pop_heap(__first, __last, __last, __comp);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool mlpack::UBTreeSplit<BoundType, MatType>::SplitNode(BoundType&, MatType&, size_t, size_t, SplitInfo&) [with BoundType = mlpack::CellBound<mlpack::LMetric<2, true> >; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/ub_tree_split_impl.hpp:36:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool mlpack::UBTreeSplit<BoundType, MatType>::SplitNode(BoundType&, MatType&, size_t, size_t, SplitInfo&) [with BoundType = mlpack::CellBound<mlpack::LMetric<2, true> >; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/ub_tree_split_impl.hpp:36:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator<double>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
/usr/include/c++/13/bits/stl_vector.h: In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double> >]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:348:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:339:46:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 1%] Linking CXX executable ../../../bin/mlpack_range_search
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_range_search.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_range_search.dir/range_search/range_search_main.cpp.o -o ../../../bin/mlpack_range_search /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 1%] Built target mlpack_range_search
make -f src/mlpack/methods/CMakeFiles/mlpack_approx_kfn.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_approx_kfn.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_approx_kfn.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_approx_kfn.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_approx_kfn.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 2%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_approx_kfn.dir/approx_kfn/approx_kfn_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_approx_kfn.dir/approx_kfn/approx_kfn_main.cpp.o -MF CMakeFiles/mlpack_approx_kfn.dir/approx_kfn/approx_kfn_main.cpp.o.d -o CMakeFiles/mlpack_approx_kfn.dir/approx_kfn/approx_kfn_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp: In function ‘void approx_kfn(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:241:28: warning: ‘new’ of type ‘ApproxKFNModel’ with extended alignment 16 [-Waligned-new=]
241 | m = new ApproxKFNModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:241:28: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:241:28: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(MatType, mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:333:29: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
39 | referenceSet(mode == NAIVE_MODE ? new MatType(std::move(referenceSetIn)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:335:19: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = ApproxKFNModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = ApproxKFNModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = ApproxKFNModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:172:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘ApproxKFNModel’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:38:24: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(MatType, mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:333:29: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/approx_kfn_main.cpp:335:19: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::EmptyStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::DrusillaSelect<>::Train(const arma::Mat<double>&, size_t, size_t)::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<less<pair<double, unsigned int> > >]’:
/usr/include/c++/13/bits/stl_heap.h:135:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
135 | __push_heap(_RandomAccessIterator __first,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<less<pair<double, unsigned int> > >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:505:16,
inlined from ‘double mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:99:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::EmptyStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::EmptyStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:505:16,
inlined from ‘double mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::EmptyStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:99:17,
inlined from ‘void mlpack::DrusillaSelect<MatType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/drusilla_select_impl.hpp:191:21:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::DrusillaSelect<>::Train(const arma::Mat<double>&, size_t, size_t)::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::DrusillaSelect<MatType>::Train(const MatType&, size_t, size_t) [with MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/drusilla_select_impl.hpp:142:16:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = std::less<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void mlpack::QDAFN<MatType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/qdafn_impl.hpp:117:17:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = std::less<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void mlpack::QDAFN<MatType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/qdafn_impl.hpp:141:24:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = std::less<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void mlpack::QDAFN<MatType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/approx_kfn/qdafn_impl.hpp:152:19:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview_col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview_col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview_col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview_col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 2%] Linking CXX executable ../../../bin/mlpack_approx_kfn
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_approx_kfn.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_approx_kfn.dir/approx_kfn/approx_kfn_main.cpp.o -o ../../../bin/mlpack_approx_kfn /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 2%] Built target mlpack_approx_kfn
make -f src/mlpack/methods/CMakeFiles/mlpack_bayesian_linear_regression.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_bayesian_linear_regression.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_bayesian_linear_regression.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_bayesian_linear_regression.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_bayesian_linear_regression.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 2%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_bayesian_linear_regression.dir/bayesian_linear_regression/bayesian_linear_regression_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_bayesian_linear_regression.dir/bayesian_linear_regression/bayesian_linear_regression_main.cpp.o -MF CMakeFiles/mlpack_bayesian_linear_regression.dir/bayesian_linear_regression/bayesian_linear_regression_main.cpp.o.d -o CMakeFiles/mlpack_bayesian_linear_regression.dir/bayesian_linear_regression/bayesian_linear_regression_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/bayesian_linear_regression/bayesian_linear_regression_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/bayesian_linear_regression/bayesian_linear_regression_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/bayesian_linear_regression/bayesian_linear_regression_main.cpp: In function ‘void bayesian_linear_regression(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/bayesian_linear_regression/bayesian_linear_regression_main.cpp:157:61: warning: ‘new’ of type ‘mlpack::BayesianLinearRegression’ with extended alignment 16 [-Waligned-new=]
157 | bayesLinReg = new BayesianLinearRegression(center, scale);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/bayesian_linear_regression/bayesian_linear_regression_main.cpp:157:61: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/bayesian_linear_regression/bayesian_linear_regression_main.cpp:157:61: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/bayesian_linear_regression/bayesian_linear_regression_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::BayesianLinearRegression; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::BayesianLinearRegression*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::BayesianLinearRegression*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/bayesian_linear_regression/bayesian_linear_regression_main.cpp:112:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::BayesianLinearRegression’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 2%] Linking CXX executable ../../../bin/mlpack_bayesian_linear_regression
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_bayesian_linear_regression.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_bayesian_linear_regression.dir/bayesian_linear_regression/bayesian_linear_regression_main.cpp.o -o ../../../bin/mlpack_bayesian_linear_regression /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 2%] Built target mlpack_bayesian_linear_regression
make -f src/mlpack/methods/CMakeFiles/mlpack_cf.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_cf.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_cf.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_cf.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_cf.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 3%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_cf.dir/cf/cf_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_cf.dir/cf/cf_main.cpp.o -MF CMakeFiles/mlpack_cf.dir/cf/cf_main.cpp.o.d -o CMakeFiles/mlpack_cf.dir/cf/cf_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd.hpp:124,
from /<<PKGBUILDDIR>>/src/mlpack/methods/cf/decomposition_policies/quic_svd_method.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/methods/cf/decomposition_policies/decomposition_policies.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf.hpp:25:
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp: In constructor ‘mlpack::QUIC_SVD::QUIC_SVD(double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:32:18: warning: unused parameter ‘epsilon’ [-Wunused-parameter]
32 | const double epsilon,
| ~~~~~~~~~~~~~^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:33:18: warning: unused parameter ‘delta’ [-Wunused-parameter]
33 | const double delta)
| ~~~~~~~~~~~~~^~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp: In member function ‘void mlpack::QUIC_SVD::Apply(const arma::mat&, arma::mat&, arma::mat&, arma::mat&, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:50:51: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
50 | ctree = new CosineTree(dataset, epsilon, delta);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:50:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:50:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:52:55: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
52 | ctree = new CosineTree(dataset.t(), epsilon, delta);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:52:55: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:52:55: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/neighbor_search_policies/cosine_search.hpp:53:3: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
93 | referenceSet(mode == NAIVE_MODE ? new MatType() : NULL), // Empty matrix.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/neighbor_search_policies/cosine_search.hpp:57:25: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/neighbor_search_policies/cosine_search.hpp:75:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:279,
from /<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = NMFPolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:319:46: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = BatchSVDPolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:322:51: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = RandomizedSVDPolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:325:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = RegSVDPolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:328:49: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = SVDCompletePolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:331:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = SVDIncompletePolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:334:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = BiasSVDPolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:337:50: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = SVDPlusPlusPolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:340:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = QUIC_SVDPolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:343:51: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::InitializeModelHelper(CFModel::NormalizationTypes) [with DecompositionPolicy = BlockKrylovSVDPolicy]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:346:57: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
293 | return new CFWrapper<DecompositionPolicy, NoNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:293:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
296 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:296:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
299 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:299:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
302 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:302:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
305 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:305:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = NMFPolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:421:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = BatchSVDPolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:426:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = RandomizedSVDPolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:431:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = RegSVDPolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:436:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = SVDCompletePolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:441:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = SVDIncompletePolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:446:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = BiasSVDPolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:451:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = SVDPlusPlusPolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:456:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = QUIC_SVDPolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:461:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp: In instantiation of ‘mlpack::CFWrapperBase* mlpack::TrainHelper(const DecompositionPolicy&, CFModel::NormalizationTypes, const arma::mat&, size_t, size_t, size_t, double, bool) [with DecompositionPolicy = BlockKrylovSVDPolicy; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:466:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
91 | return new CFWrapper<DecompositionPolicy, NoNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
92 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
93 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:91:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
96 | return new CFWrapper<DecompositionPolicy, ItemMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
97 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
98 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:96:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
101 | return new CFWrapper<DecompositionPolicy, UserMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:101:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
106 | return new CFWrapper<DecompositionPolicy, OverallMeanNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
107 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:106:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
111 | return new CFWrapper<DecompositionPolicy, ZScoreNormalization>(data,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
112 | decomposition, numUsersForSimilarity, rank, maxIterations, minResidue,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
113 | mit);
| ~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:111:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/neighbor_search_policies/cosine_search.hpp:53:3: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/neighbor_search_policies/cosine_search.hpp:75:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BlockKrylovSVDPolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
117 | virtual CFWrapper* Clone() const { return new CFWrapper(*this); }
| ^~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BlockKrylovSVDPolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BlockKrylovSVDPolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BlockKrylovSVDPolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BlockKrylovSVDPolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BlockKrylovSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::QUIC_SVDPolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::QUIC_SVDPolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::QUIC_SVDPolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::QUIC_SVDPolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::QUIC_SVDPolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::QUIC_SVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDPlusPlusPolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDPlusPlusPolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDPlusPlusPolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDPlusPlusPolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDPlusPlusPolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDPlusPlusPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BiasSVDPolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BiasSVDPolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BiasSVDPolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BiasSVDPolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BiasSVDPolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BiasSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDIncompletePolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDIncompletePolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDIncompletePolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDIncompletePolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDIncompletePolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDIncompletePolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDCompletePolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDCompletePolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDCompletePolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDCompletePolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::SVDCompletePolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::SVDCompletePolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RegSVDPolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RegSVDPolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RegSVDPolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RegSVDPolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RegSVDPolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RegSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RandomizedSVDPolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RandomizedSVDPolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RandomizedSVDPolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RandomizedSVDPolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::RandomizedSVDPolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::RandomizedSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BatchSVDPolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BatchSVDPolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BatchSVDPolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BatchSVDPolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::BatchSVDPolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::BatchSVDPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::NMFPolicy; NormalizationPolicy = mlpack::ZScoreNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::ZScoreNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::NMFPolicy; NormalizationPolicy = mlpack::OverallMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::OverallMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::NMFPolicy; NormalizationPolicy = mlpack::UserMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::UserMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::NMFPolicy; NormalizationPolicy = mlpack::ItemMeanNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::ItemMeanNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp: In instantiation of ‘mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>* mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Clone() const [with DecompositionPolicy = mlpack::NMFPolicy; NormalizationPolicy = mlpack::NoNormalization]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: warning: ‘new’ of type ‘mlpack::CFWrapper<mlpack::NMFPolicy, mlpack::NoNormalization>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(MatType, mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/neighbor_search_policies/lmetric_search.hpp:50:50: required from ‘mlpack::LMetricSearch<TPower>::LMetricSearch(const arma::mat&) [with int TPower = 2; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/decomposition_policies/block_krylov_svd_method.hpp:144:26: required from ‘void mlpack::BlockKrylovSVDPolicy::GetNeighborhood(const arma::Col<unsigned int>&, size_t, arma::Mat<unsigned int>&, arma::mat&) const [with NeighborSearchPolicy = mlpack::LMetricSearch<2>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_impl.hpp:346:63: required from ‘void mlpack::CFType<DecompositionPolicy, NormalizationType>::Predict(const arma::Mat<unsigned int>&, arma::vec&) const [with NeighborSearchPolicy = mlpack::LMetricSearch<2>; InterpolationPolicy = mlpack::AverageInterpolation; DecompositionPolicy = mlpack::BlockKrylovSVDPolicy; NormalizationType = mlpack::ZScoreNormalization; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:130:48: required from ‘void mlpack::PredictHelper(CFType&, InterpolationTypes, const arma::Mat<unsigned int>&, arma::vec&) [with NeighborSearchPolicy = LMetricSearch<2>; CFType = CFType<BlockKrylovSVDPolicy, ZScoreNormalization>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:161:37: required from ‘void mlpack::CFWrapper<DecompositionPolicy, NormalizationPolicy>::Predict(mlpack::NeighborSearchTypes, mlpack::InterpolationTypes, const arma::Mat<unsigned int>&, arma::vec&) [with DecompositionPolicy = mlpack::BlockKrylovSVDPolicy; NormalizationPolicy = mlpack::ZScoreNormalization; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/cf/cf_model_impl.hpp:147:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
39 | referenceSet(mode == NAIVE_MODE ? new MatType(std::move(referenceSetIn)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::NMFPolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::NMFPolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::NMFPolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::NMFPolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BatchSVDPolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BatchSVDPolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BatchSVDPolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BatchSVDPolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BatchSVDPolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RandomizedSVDPolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RandomizedSVDPolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RandomizedSVDPolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RandomizedSVDPolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RandomizedSVDPolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RegSVDPolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RegSVDPolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RegSVDPolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RegSVDPolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::RegSVDPolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDCompletePolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDCompletePolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDCompletePolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDCompletePolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDCompletePolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDIncompletePolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDIncompletePolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDIncompletePolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDIncompletePolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDIncompletePolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BiasSVDPolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BiasSVDPolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BiasSVDPolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BiasSVDPolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BiasSVDPolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDPlusPlusPolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDPlusPlusPolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDPlusPlusPolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDPlusPlusPolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::SVDPlusPlusPolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::QUIC_SVDPolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::QUIC_SVDPolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::QUIC_SVDPolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::QUIC_SVDPolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::QUIC_SVDPolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BlockKrylovSVDPolicy, mlpack::NoNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BlockKrylovSVDPolicy, mlpack::ItemMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BlockKrylovSVDPolicy, mlpack::UserMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BlockKrylovSVDPolicy, mlpack::OverallMeanNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::CFType<mlpack::BlockKrylovSVDPolicy, mlpack::ZScoreNormalization>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
/usr/include/c++/13/bits/stl_vector.h: In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 3%] Linking CXX executable ../../../bin/mlpack_cf
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_cf.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_cf.dir/cf/cf_main.cpp.o -o ../../../bin/mlpack_cf /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 3%] Built target mlpack_cf
make -f src/mlpack/methods/CMakeFiles/mlpack_dbscan.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_dbscan.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_dbscan.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_dbscan.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_dbscan.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 3%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_dbscan.dir/dbscan/dbscan_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_dbscan.dir/dbscan/dbscan_main.cpp.o -MF CMakeFiles/mlpack_dbscan.dir/dbscan/dbscan_main.cpp.o.d -o CMakeFiles/mlpack_dbscan.dir/dbscan/dbscan_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search.hpp:327,
from /<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:167:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
78 | referenceSet(naive ? new MatType() : NULL), // Empty matrix.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:168:31: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
78 | referenceSet(naive ? new MatType() : NULL), // Empty matrix.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:78:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:168:31: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:180:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:185:18: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:190:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:195:18: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:200:25: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:205:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:210:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:26:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:215:21: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: warning: ‘new’ of type ‘mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
104 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
106 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:106:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:167:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree.hpp:580,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, ElemType) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = CoverTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, FirstPointIsRoot>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
239 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:180:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
509 | new MatType(*other.dataset) : other.dataset),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp:638,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:20,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:22:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:185:18: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RStarTreeSplit, RStarTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:190:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, XTreeSplit, RTreeDescentHeuristic, XTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:195:18: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:200:25: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:205:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:210:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:215:21: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:168:31: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:180:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:185:18: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:190:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:195:18: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:200:25: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:205:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:210:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Train(MatType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:104:20: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:215:21: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
255 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp:296,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:35:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:30:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:111:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:89:36: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:135:54: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
46 | new arma::Col<HilbertElemType>(tree->Dataset().n_rows)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
61 | localHilbertValues = new arma::Mat<HilbertElemType>(tree->Dataset().n_rows,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
62 | tree->MaxLeafSize() + 1);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const mlpack::DiscreteHilbertValue<TreeElemType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:40:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:191:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:104:41: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(const mlpack::RangeSearch<MetricType, MatType, TreeType>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:200:25: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
83 | localHilbertValues = new arma::Mat<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
84 | *other.LocalHilbertValues());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
90 | valueToInsert = new arma::Col<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
91 | *other.ValueToInsert());
| ~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:215:21: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:168:31: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:185:18: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RStarTreeSplit, RStarTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RStarTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:190:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, XTreeSplit, RTreeDescentHeuristic, XTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::XTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:195:18: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::HilbertRTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:200:25: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:205:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::RPlusPlusTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:210:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:184:23: required from ‘void mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::PointwiseCluster(const MatType&, mlpack::UnionFind&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_impl.hpp:109:21: required from ‘size_t mlpack::DBSCAN<RangeSearchType, PointSelectionPolicy>::Cluster(const MatType&, arma::Row<unsigned int>&) [with MatType = arma::Mat<double>; RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>; PointSelectionPolicy = mlpack::OrderedPointSelection; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:125:14: required from ‘void RunDBSCAN(mlpack::util::Params&, RangeSearchType, PointSelectionPolicy) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>; PointSelectionPolicy = mlpack::OrderedPointSelection]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:140:54: required from ‘void ChoosePointSelectionPolicy(mlpack::util::Params&, RangeSearchType) [with RangeSearchType = mlpack::RangeSearch<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/dbscan/dbscan_main.cpp:215:21: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator<double>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
/usr/include/c++/13/bits/stl_vector.h: In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/string:51,
from /usr/include/c++/13/stdexcept:39,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:34:
/usr/include/c++/13/bits/stl_algobase.h: In function ‘void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >]’:
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Distance = int; _Tp = pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1942 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:497:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:658:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:560:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:339:46:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RangeSearchRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int>, allocator<pair<double, unsigned int> > > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 4%] Linking CXX executable ../../../bin/mlpack_dbscan
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_dbscan.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_dbscan.dir/dbscan/dbscan_main.cpp.o -o ../../../bin/mlpack_dbscan /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 4%] Built target mlpack_dbscan
make -f src/mlpack/methods/CMakeFiles/mlpack_decision_tree.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_decision_tree.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_decision_tree.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_decision_tree.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_decision_tree.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 4%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_decision_tree.dir/decision_tree/decision_tree_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_decision_tree.dir/decision_tree/decision_tree_main.cpp.o -MF CMakeFiles/mlpack_decision_tree.dir/decision_tree/decision_tree_main.cpp.o.d -o CMakeFiles/mlpack_decision_tree.dir/decision_tree/decision_tree_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp: In function ‘void decision_tree(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:196:35: warning: ‘new’ of type ‘DecisionTreeModel’ with extended alignment 16 [-Waligned-new=]
196 | model = new DecisionTreeModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:196:35: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:196:35: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree.hpp:616,
from /<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp: In instantiation of ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType&, size_t, size_t, const mlpack::data::DatasetInfo&, arma::Row<unsigned int>&, size_t, arma::rowvec&, size_t, double, size_t, DimensionSelectionType&) [with bool UseWeights = true; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::AllDimensionSelect; bool NoRecursion = false; size_t = unsigned int; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; arma::rowvec = arma::Row<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:130:14: required from ‘mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::DecisionTree(MatType, const mlpack::data::DatasetInfo&, LabelsType, size_t, WeightsType, size_t, double, size_t, DimensionSelectionType, std::enable_if_t<arma::is_arma_type<typename std::remove_reference<WeightsType>::type>::value>*) [with MatType = arma::Mat<double>; LabelsType = arma::Row<unsigned int>; WeightsType = arma::Row<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::AllDimensionSelect; bool NoRecursion = false; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int; std::enable_if_t<arma::is_arma_type<typename std::remove_reference<WeightsType>::type>::value> = void; typename std::remove_reference<WeightsType>::type = arma::Row<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:231:21: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: warning: ‘new’ of type ‘mlpack::DecisionTree<>’ with extended alignment 16 [-Waligned-new=]
761 | DecisionTree* child = new DecisionTree();
| ^~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp: In instantiation of ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType&, size_t, size_t, const mlpack::data::DatasetInfo&, arma::Row<unsigned int>&, size_t, arma::rowvec&, size_t, double, size_t, DimensionSelectionType&) [with bool UseWeights = false; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::AllDimensionSelect; bool NoRecursion = false; size_t = unsigned int; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; arma::rowvec = arma::Row<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:52:15: required from ‘mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::DecisionTree(MatType, const mlpack::data::DatasetInfo&, LabelsType, size_t, size_t, double, size_t, DimensionSelectionType) [with MatType = arma::Mat<double>; LabelsType = arma::Row<unsigned int>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::AllDimensionSelect; bool NoRecursion = false; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:245:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: warning: ‘new’ of type ‘mlpack::DecisionTree<>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = DecisionTreeModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = DecisionTreeModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = DecisionTreeModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_main.cpp:152:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘DecisionTreeModel’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 4%] Linking CXX executable ../../../bin/mlpack_decision_tree
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_decision_tree.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_decision_tree.dir/decision_tree/decision_tree_main.cpp.o -o ../../../bin/mlpack_decision_tree /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 4%] Built target mlpack_decision_tree
make -f src/mlpack/methods/CMakeFiles/mlpack_det.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_det.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_det.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_det.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_det.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 4%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_det.dir/det/det_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_det.dir/det/det_main.cpp.o -MF CMakeFiles/mlpack_det.dir/det/det_main.cpp.o.d -o CMakeFiles/mlpack_det.dir/det/det_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/det/det_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/det/det_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils.hpp:147,
from /<<PKGBUILDDIR>>/src/mlpack/methods/det/det_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp: In instantiation of ‘mlpack::DTree<MatType, TagType>* mlpack::Trainer(MatType&, size_t, bool, size_t, size_t, bool, util::Timers&) [with MatType = arma::Mat<double>; TagType = int; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/det/det_main.cpp:174:35: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:118:36: warning: ‘new’ of type ‘mlpack::DTree<>’ with extended alignment 16 [-Waligned-new=]
118 | DTree<MatType, TagType>* dtree = new DTree<MatType, TagType>(dataset);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:118:36: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:118:36: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:286:11: warning: ‘new’ of type ‘mlpack::DTree<>’ with extended alignment 16 [-Waligned-new=]
286 | dtree = new DTree<MatType, TagType>(dataset);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:286:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:286:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree.hpp:361,
from /<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree_impl.hpp: In instantiation of ‘double mlpack::DTree<MatType, TagType>::Grow(MatType&, arma::Col<unsigned int>&, bool, size_t, size_t) [with MatType = arma::Mat<double>; TagType = int; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:131:29: required from ‘mlpack::DTree<MatType, TagType>* mlpack::Trainer(MatType&, size_t, bool, size_t, size_t, bool, util::Timers&) [with MatType = arma::Mat<double>; TagType = int; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/det/det_main.cpp:174:35: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree_impl.hpp:631:14: warning: ‘new’ of type ‘mlpack::DTree<>’ with extended alignment 16 [-Waligned-new=]
631 | left = new DTree(maxValsL, minValsL, start, splitIndex, leftError);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree_impl.hpp:631:14: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree_impl.hpp:631:14: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree_impl.hpp:632:15: warning: ‘new’ of type ‘mlpack::DTree<>’ with extended alignment 16 [-Waligned-new=]
632 | right = new DTree(maxValsR, minValsR, splitIndex, end, rightError);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree_impl.hpp:632:15: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree_impl.hpp:632:15: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/det/det_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::DTree<>; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::DTree<>*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::DTree<>*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/det/det_main.cpp:81:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::DTree<>’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, double>&}; _Tp = std::pair<double, double>; _Alloc = std::allocator<std::pair<double, double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, double> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, double>; _Alloc = std::allocator<std::pair<double, double> >]’,
inlined from ‘mlpack::DTree<MatType, TagType>* mlpack::Trainer(MatType&, size_t, bool, size_t, size_t, bool, util::Timers&) [with MatType = arma::Mat<double>; TagType = int]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:155:29:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, double>*, std::vector<std::pair<double, double> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, double>; _Alloc = std::allocator<std::pair<double, double> >]’,
inlined from ‘mlpack::DTree<MatType, TagType>* mlpack::Trainer(MatType&, size_t, bool, size_t, size_t, bool, util::Timers&) [with MatType = arma::Mat<double>; TagType = int]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/det/dt_utils_impl.hpp:170:27:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, double>*, std::vector<std::pair<double, double> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void mlpack::ExtractSplits(std::vector<std::pair<MatType, unsigned int> >&, const arma::Mat<eT>&, size_t, size_t, size_t, size_t) [with ElemType = double]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/det/dtree_impl.hpp:80:25:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 5%] Linking CXX executable ../../../bin/mlpack_det
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_det.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_det.dir/det/det_main.cpp.o -o ../../../bin/mlpack_det /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 5%] Built target mlpack_det
make -f src/mlpack/methods/CMakeFiles/mlpack_emst.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_emst.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_emst.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_emst.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_emst.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 5%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_emst.dir/emst/emst_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_emst.dir/emst/emst_main.cpp.o -MF CMakeFiles/mlpack_emst.dir/emst/emst_main.cpp.o.d -o CMakeFiles/mlpack_emst.dir/emst/emst_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/emst/emst_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/emst/emst_main.cpp:27:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DTBStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/emst/emst_main.cpp:130:17: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Distance = int; _Tp = mlpack::EdgePair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::DualTreeBoruvka<>::SortEdgesHelper>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<mlpack::DualTreeBoruvka<>::SortEdgesHelper>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::DualTreeBoruvka<>::SortEdgesHelper>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {mlpack::EdgePair}; _Tp = mlpack::EdgePair; _Alloc = std::allocator<mlpack::EdgePair>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::EdgePair>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::EdgePair}; _Tp = mlpack::EdgePair; _Alloc = std::allocator<mlpack::EdgePair>]’:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::DualTreeBoruvka<>::SortEdgesHelper>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::DualTreeBoruvka<>::SortEdgesHelper>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Compare = mlpack::DualTreeBoruvka<>::SortEdgesHelper]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::DualTreeBoruvka<MetricType, MatType, TreeType>::EmitResults(arma::mat&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/emst/dtb_impl.hpp:200:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::DualTreeBoruvka<>::SortEdgesHelper>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::DualTreeBoruvka<>::SortEdgesHelper>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::EdgePair*, vector<mlpack::EdgePair> >; _Compare = mlpack::DualTreeBoruvka<>::SortEdgesHelper]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::DualTreeBoruvka<MetricType, MatType, TreeType>::EmitResults(arma::mat&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/emst/dtb_impl.hpp:200:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::EdgePair*, std::vector<mlpack::EdgePair> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 5%] Linking CXX executable ../../../bin/mlpack_emst
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_emst.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_emst.dir/emst/emst_main.cpp.o -o ../../../bin/mlpack_emst /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 5%] Built target mlpack_emst
make -f src/mlpack/methods/CMakeFiles/mlpack_fastmks.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_fastmks.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_fastmks.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_fastmks.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_fastmks.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 5%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_fastmks.dir/fastmks/fastmks_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_fastmks.dir/fastmks/fastmks_main.cpp.o -MF CMakeFiles/mlpack_fastmks.dir/fastmks/fastmks_main.cpp.o.d -o CMakeFiles/mlpack_fastmks.dir/fastmks/fastmks_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks.hpp:344,
from /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::LinearKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:35:48: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
172 | referenceSet = new MatType(*other.referenceSet);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::PolynomialKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:37:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::CosineDistance; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:39:50: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:41:52: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::EpanechnikovKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:43:52: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::TriangularKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:45:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::HyperbolicTangentKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:47:59: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:172:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree.hpp:580,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:161:41: required from ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::LinearKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:35:48: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
509 | new MatType(*other.dataset) : other.dataset),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:161:41: required from ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::PolynomialKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:37:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:161:41: required from ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::CosineDistance; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:39:50: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:161:41: required from ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:41:52: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:161:41: required from ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::EpanechnikovKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:43:52: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:161:41: required from ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::TriangularKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:45:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:161:41: required from ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(const mlpack::FastMKS<KernelType, MatType, TreeType>&) [with KernelType = mlpack::HyperbolicTangentKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:47:59: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(bool, bool) [with KernelType = mlpack::LinearKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:332:16: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
30 | referenceSet(new MatType()),
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(bool, bool) [with KernelType = mlpack::PolynomialKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:337:20: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(bool, bool) [with KernelType = mlpack::CosineDistance; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:343:16: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(bool, bool) [with KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:348:18: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(bool, bool) [with KernelType = mlpack::EpanechnikovKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:354:14: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(bool, bool) [with KernelType = mlpack::TriangularKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:359:20: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘mlpack::FastMKS<KernelType, MatType, TreeType>::FastMKS(bool, bool) [with KernelType = mlpack::HyperbolicTangentKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:365:16: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:30:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Train(MatType&&, KernelType&) [with KernelType = mlpack::LinearKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:267:12: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:333:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
374 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, MetricType&, ElemType) [with MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:275:9: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:333:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:176:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
336 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Train(MatType&&, KernelType&) [with KernelType = mlpack::PolynomialKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:267:12: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = PolynomialKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:338:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::PolynomialKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:183:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
374 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, MetricType&, ElemType) [with MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:275:9: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = PolynomialKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:338:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::PolynomialKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:183:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
336 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Train(MatType&&, KernelType&) [with KernelType = mlpack::CosineDistance; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:267:12: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = CosineDistance; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:344:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::CosineDistance; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:190:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
374 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, MetricType&, ElemType) [with MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:275:9: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = CosineDistance; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:344:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::CosineDistance; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:190:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
336 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Train(MatType&&, KernelType&) [with KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:267:12: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = GaussianKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:349:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::GaussianKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:197:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
374 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, MetricType&, ElemType) [with MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:275:9: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = GaussianKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:349:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::GaussianKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:197:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
336 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Train(MatType&&, KernelType&) [with KernelType = mlpack::EpanechnikovKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:267:12: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = EpanechnikovKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:355:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::EpanechnikovKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:204:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
374 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, MetricType&, ElemType) [with MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:275:9: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = EpanechnikovKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:355:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::EpanechnikovKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:204:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
336 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Train(MatType&&, KernelType&) [with KernelType = mlpack::TriangularKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:267:12: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = TriangularKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:360:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::TriangularKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:211:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
374 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, MetricType&, ElemType) [with MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:275:9: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = TriangularKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:360:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::TriangularKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:211:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
336 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp: In instantiation of ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Train(MatType&&, KernelType&) [with KernelType = mlpack::HyperbolicTangentKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:267:12: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = HyperbolicTangentKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:366:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::HyperbolicTangentKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:218:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
374 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:374:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, MetricType&, ElemType) [with MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:275:9: required from ‘void mlpack::BuildFastMKSModel(util::Timers&, FastMKS<KernelType>&, KernelType&, arma::mat&&, double) [with KernelType = HyperbolicTangentKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_model_impl.hpp:366:24: required from ‘void mlpack::FastMKSModel::BuildModel(mlpack::util::Timers&, arma::mat&&, TKernelType&, bool, bool, double) [with TKernelType = mlpack::HyperbolicTangentKernel; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_main.cpp:218:24: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
336 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:336:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::HyperbolicTangentKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::TriangularKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::EpanechnikovKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::GaussianKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::CosineDistance>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::PolynomialKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::LinearKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:73:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::LinearKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::PolynomialKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::CosineDistance>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::GaussianKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::EpanechnikovKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::TriangularKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::FastMKS<mlpack::HyperbolicTangentKernel>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::LinearKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::LinearKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::LinearKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::LinearKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::LinearKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::LinearKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:444:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::LinearKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::LinearKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:455:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::LinearKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::LinearKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::LinearKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:571:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::LinearKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::LinearKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:585:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::PolynomialKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::PolynomialKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::PolynomialKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::PolynomialKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::PolynomialKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::PolynomialKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:444:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::PolynomialKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::PolynomialKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:455:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::PolynomialKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::PolynomialKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::PolynomialKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:571:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::PolynomialKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::PolynomialKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:585:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::CosineDistance>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::CosineDistance, mlpack::CoverTree<mlpack::IPMetric<mlpack::CosineDistance>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::CosineDistance>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::CosineDistance>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::CosineDistance; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:444:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::CosineDistance>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::CosineDistance; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:455:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::CosineDistance>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::CosineDistance>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::CosineDistance; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:571:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::CosineDistance>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::CosineDistance; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:585:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::GaussianKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::GaussianKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::GaussianKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::GaussianKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::GaussianKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:444:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::GaussianKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:455:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::GaussianKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::GaussianKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:571:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::GaussianKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:585:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::EpanechnikovKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::EpanechnikovKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::EpanechnikovKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::EpanechnikovKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::EpanechnikovKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:444:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::EpanechnikovKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::EpanechnikovKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:455:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::EpanechnikovKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::EpanechnikovKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::EpanechnikovKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:571:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::EpanechnikovKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::EpanechnikovKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:585:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::TriangularKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::TriangularKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::TriangularKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::TriangularKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::TriangularKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::TriangularKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:444:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::TriangularKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::TriangularKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:455:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::TriangularKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::TriangularKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::TriangularKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:571:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::TriangularKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::TriangularKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:585:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::IPMetric<mlpack::HyperbolicTangentKernel>; StatisticType = mlpack::FastMKSStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::FastMKSRules<mlpack::HyperbolicTangentKernel, mlpack::CoverTree<mlpack::IPMetric<mlpack::HyperbolicTangentKernel>, mlpack::FastMKSStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::HyperbolicTangentKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::HyperbolicTangentKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::HyperbolicTangentKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:444:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::HyperbolicTangentKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::HyperbolicTangentKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:455:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::FastMKS<mlpack::HyperbolicTangentKernel>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::HyperbolicTangentKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::HyperbolicTangentKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:571:21:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::FastMKS<mlpack::HyperbolicTangentKernel>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::FastMKS<KernelType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with KernelType = mlpack::HyperbolicTangentKernel; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/fastmks/fastmks_impl.hpp:585:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 6%] Linking CXX executable ../../../bin/mlpack_fastmks
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_fastmks.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_fastmks.dir/fastmks/fastmks_main.cpp.o -o ../../../bin/mlpack_fastmks /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 6%] Built target mlpack_fastmks
make -f src/mlpack/methods/CMakeFiles/mlpack_gmm_train.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_gmm_train.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_gmm_train.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_gmm_train.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_gmm_train.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 6%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_gmm_train.dir/gmm/gmm_train_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_gmm_train.dir/gmm/gmm_train_main.cpp.o -MF CMakeFiles/mlpack_gmm_train.dir/gmm/gmm_train_main.cpp.o.d -o CMakeFiles/mlpack_gmm_train.dir/gmm/gmm_train_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/em_fit.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp: In function ‘void gmm_train(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:226:57: warning: ‘new’ of type ‘mlpack::GMM’ with extended alignment 16 [-Waligned-new=]
226 | gmm = new GMM(size_t(gaussians), dataPoints.n_rows);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:226:57: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:226:57: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:291:57: warning: ‘new’ of type ‘mlpack::GMM’ with extended alignment 16 [-Waligned-new=]
291 | gmm = new GMM(size_t(gaussians), dataPoints.n_rows);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:291:57: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:291:57: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::GMM; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::GMM*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::GMM*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_train_main.cpp:144:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::GMM’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 6%] Linking CXX executable ../../../bin/mlpack_gmm_train
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_gmm_train.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_gmm_train.dir/gmm/gmm_train_main.cpp.o -o ../../../bin/mlpack_gmm_train /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 6%] Built target mlpack_gmm_train
make -f src/mlpack/methods/CMakeFiles/mlpack_gmm_generate.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_gmm_generate.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_gmm_generate.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_gmm_generate.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_gmm_generate.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 6%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_gmm_generate.dir/gmm/gmm_generate_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_gmm_generate.dir/gmm/gmm_generate_main.cpp.o -MF CMakeFiles/mlpack_gmm_generate.dir/gmm/gmm_generate_main.cpp.o.d -o CMakeFiles/mlpack_gmm_generate.dir/gmm/gmm_generate_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_generate_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_generate_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/em_fit.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_generate_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_generate_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::GMM; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::GMM*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::GMM*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_generate_main.cpp:57:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::GMM’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 6%] Linking CXX executable ../../../bin/mlpack_gmm_generate
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_gmm_generate.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_gmm_generate.dir/gmm/gmm_generate_main.cpp.o -o ../../../bin/mlpack_gmm_generate /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 6%] Built target mlpack_gmm_generate
make -f src/mlpack/methods/CMakeFiles/mlpack_gmm_probability.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_gmm_probability.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_gmm_probability.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_gmm_probability.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_gmm_probability.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 7%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_gmm_probability.dir/gmm/gmm_probability_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_gmm_probability.dir/gmm/gmm_probability_main.cpp.o -MF CMakeFiles/mlpack_gmm_probability.dir/gmm/gmm_probability_main.cpp.o.d -o CMakeFiles/mlpack_gmm_probability.dir/gmm/gmm_probability_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_probability_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_probability_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/em_fit.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_probability_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_probability_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::GMM; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::GMM*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::GMM*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_probability_main.cpp:59:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::GMM’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 7%] Linking CXX executable ../../../bin/mlpack_gmm_probability
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_gmm_probability.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_gmm_probability.dir/gmm/gmm_probability_main.cpp.o -o ../../../bin/mlpack_gmm_probability /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 7%] Built target mlpack_gmm_probability
make -f src/mlpack/methods/CMakeFiles/mlpack_hmm_train.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hmm_train.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_hmm_train.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_hmm_train.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hmm_train.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 7%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_hmm_train.dir/hmm/hmm_train_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_hmm_train.dir/hmm/hmm_train_main.cpp.o -MF CMakeFiles/mlpack_hmm_train.dir/hmm/hmm_train_main.cpp.o.d -o CMakeFiles/mlpack_hmm_train.dir/hmm/hmm_train_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_train_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_train_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/em_fit.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_train_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In constructor ‘mlpack::HMMModel::HMMModel(mlpack::HMMType)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
57 | discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
59 | gaussianHMM = new HMM<GaussianDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
61 | gmmHMM = new HMM<GMM>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
63 | diagGMMHMM = new HMM<DiagonalGMM>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In copy constructor ‘mlpack::HMMModel::HMMModel(const mlpack::HMMModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
76 | new HMM<DiscreteDistribution>(*other.discreteHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
79 | new HMM<GaussianDistribution>(*other.gaussianHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
81 | gmmHMM = new HMM<GMM>(*other.gmmHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
83 | diagGMMHMM = new HMM<DiagonalGMM>(*other.diagGMMHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In constructor ‘mlpack::HMMModel::HMMModel(mlpack::HMMModel&&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
95 | other.discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In member function ‘mlpack::HMMModel& mlpack::HMMModel::operator=(const mlpack::HMMModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
120 | new HMM<DiscreteDistribution>(*other.discreteHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
123 | new HMM<GaussianDistribution>(*other.gaussianHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
125 | gmmHMM = new HMM<GMM>(*other.gmmHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
127 | diagGMMHMM = new HMM<DiagonalGMM>(*other.diagGMMHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In member function ‘mlpack::HMMModel& mlpack::HMMModel::operator=(mlpack::HMMModel&&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
144 | other.discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:65,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, vector<mlpack::GaussianDistribution> >; _ForwardIterator = mlpack::GaussianDistribution*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, std::vector<mlpack::GaussianDistribution> >’ changed in GCC 7.1
113 | __do_uninit_copy(_InputIterator __first, _InputIterator __last,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, std::vector<mlpack::GaussianDistribution> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, vector<mlpack::DiagonalGaussianDistribution> >; _ForwardIterator = mlpack::DiagonalGaussianDistribution*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, std::vector<mlpack::DiagonalGaussianDistribution> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, std::vector<mlpack::DiagonalGaussianDistribution> >’ changed in GCC 7.1
In static member function ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, std::vector<mlpack::GaussianDistribution> >; _ForwardIterator = mlpack::GaussianDistribution*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, vector<mlpack::GaussianDistribution> >; _ForwardIterator = mlpack::GaussianDistribution*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:15,
inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, vector<mlpack::GaussianDistribution> >; _ForwardIterator = mlpack::GaussianDistribution*; _Tp = mlpack::GaussianDistribution]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = mlpack::GaussianDistribution; _Alloc = std::allocator<mlpack::GaussianDistribution>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘mlpack::GMM::GMM(const mlpack::GMM&)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_impl.hpp:43:5,
inlined from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = mlpack::GMM; _Args = {const mlpack::GMM&}]’ at /usr/include/c++/13/bits/stl_construct.h:119:7,
inlined from ‘_ForwardIterator std::__do_uninit_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = mlpack::GMM*; _Size = unsigned int; _Tp = mlpack::GMM]’ at /usr/include/c++/13/bits/stl_uninitialized.h:267:21:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, std::vector<mlpack::GaussianDistribution> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In static member function ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, std::vector<mlpack::DiagonalGaussianDistribution> >; _ForwardIterator = mlpack::DiagonalGaussianDistribution*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, vector<mlpack::DiagonalGaussianDistribution> >; _ForwardIterator = mlpack::DiagonalGaussianDistribution*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:15,
inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, vector<mlpack::DiagonalGaussianDistribution> >; _ForwardIterator = mlpack::DiagonalGaussianDistribution*; _Tp = mlpack::DiagonalGaussianDistribution]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = mlpack::DiagonalGaussianDistribution; _Alloc = std::allocator<mlpack::DiagonalGaussianDistribution>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘mlpack::DiagonalGMM::DiagonalGMM(const mlpack::DiagonalGMM&)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/diagonal_gmm_impl.hpp:127:5,
inlined from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = mlpack::DiagonalGMM; _Args = {const mlpack::DiagonalGMM&}]’ at /usr/include/c++/13/bits/stl_construct.h:119:7,
inlined from ‘_ForwardIterator std::__do_uninit_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = mlpack::DiagonalGMM*; _Size = unsigned int; _Tp = mlpack::DiagonalGMM]’ at /usr/include/c++/13/bits/stl_uninitialized.h:267:21:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, std::vector<mlpack::DiagonalGaussianDistribution> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {arma::Mat<double>}; _Tp = arma::Mat<double>; _Alloc = std::allocator<arma::Mat<double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<arma::Mat<double> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {arma::Col<double>}; _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<arma::Col<double> >::iterator’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {arma::Col<double>}; _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘mlpack::DiscreteDistribution::DiscreteDistribution(const arma::Col<unsigned int>&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/dists/discrete_distribution.hpp:83:30:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Col<double>*, std::vector<arma::Col<double> > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {arma::Row<unsigned int>}; _Tp = arma::Row<unsigned int>; _Alloc = std::allocator<arma::Row<unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<arma::Row<unsigned int>, std::allocator<arma::Row<unsigned int> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {arma::Row<unsigned int>}; _Tp = arma::Row<unsigned int>; _Alloc = std::allocator<arma::Row<unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Row<unsigned int>*, std::vector<arma::Row<unsigned int>, std::allocator<arma::Row<unsigned int> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {arma::Mat<double>}; _Tp = arma::Mat<double>; _Alloc = std::allocator<arma::Mat<double> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = arma::Mat<double>; _Alloc = std::allocator<arma::Mat<double> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void hmm_train(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_train_main.cpp:498:25:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Mat<double>*, std::vector<arma::Mat<double> > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In static member function ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, std::vector<mlpack::GaussianDistribution> >; _ForwardIterator = mlpack::GaussianDistribution*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, vector<mlpack::GaussianDistribution> >; _ForwardIterator = mlpack::GaussianDistribution*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:15,
inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, vector<mlpack::GaussianDistribution> >; _ForwardIterator = mlpack::GaussianDistribution*; _Tp = mlpack::GaussianDistribution]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = mlpack::GaussianDistribution; _Alloc = std::allocator<mlpack::GaussianDistribution>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘mlpack::GMM::GMM(const mlpack::GMM&)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm_impl.hpp:43:5,
inlined from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = mlpack::GMM; _Args = {const mlpack::GMM&}]’ at /usr/include/c++/13/bits/stl_construct.h:119:7,
inlined from ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::GMM*; _ForwardIterator = mlpack::GMM*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:120:21,
inlined from ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::GMM*; _ForwardIterator = mlpack::GMM*; bool _TrivialValueTypes = false]’ at /usr/include/c++/13/bits/stl_uninitialized.h:137:32,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::GMM*; _ForwardIterator = mlpack::GMM*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:15,
inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = const mlpack::GMM*; _ForwardIterator = mlpack::GMM*; _Tp = mlpack::GMM]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘_ForwardIterator std::__uninitialized_move_if_noexcept_a(_InputIterator, _InputIterator, _ForwardIterator, _Allocator&) [with _InputIterator = mlpack::GMM*; _ForwardIterator = mlpack::GMM*; _Allocator = allocator<mlpack::GMM>]’ at /usr/include/c++/13/bits/stl_uninitialized.h:399:2,
inlined from ‘void std::vector<_Tp, _Alloc>::_M_default_append(size_type) [with _Tp = mlpack::GMM; _Alloc = std::allocator<mlpack::GMM>]’ at /usr/include/c++/13/bits/vector.tcc:687:48:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const mlpack::GaussianDistribution*, std::vector<mlpack::GaussianDistribution> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In static member function ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, std::vector<mlpack::DiagonalGaussianDistribution> >; _ForwardIterator = mlpack::DiagonalGaussianDistribution*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, vector<mlpack::DiagonalGaussianDistribution> >; _ForwardIterator = mlpack::DiagonalGaussianDistribution*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:15,
inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, vector<mlpack::DiagonalGaussianDistribution> >; _ForwardIterator = mlpack::DiagonalGaussianDistribution*; _Tp = mlpack::DiagonalGaussianDistribution]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = mlpack::DiagonalGaussianDistribution; _Alloc = std::allocator<mlpack::DiagonalGaussianDistribution>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘mlpack::DiagonalGMM::DiagonalGMM(const mlpack::DiagonalGMM&)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/diagonal_gmm_impl.hpp:127:5,
inlined from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = mlpack::DiagonalGMM; _Args = {const mlpack::DiagonalGMM&}]’ at /usr/include/c++/13/bits/stl_construct.h:119:7,
inlined from ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::DiagonalGMM*; _ForwardIterator = mlpack::DiagonalGMM*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:120:21,
inlined from ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::DiagonalGMM*; _ForwardIterator = mlpack::DiagonalGMM*; bool _TrivialValueTypes = false]’ at /usr/include/c++/13/bits/stl_uninitialized.h:137:32,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::DiagonalGMM*; _ForwardIterator = mlpack::DiagonalGMM*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:15,
inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = const mlpack::DiagonalGMM*; _ForwardIterator = mlpack::DiagonalGMM*; _Tp = mlpack::DiagonalGMM]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘_ForwardIterator std::__uninitialized_move_if_noexcept_a(_InputIterator, _InputIterator, _ForwardIterator, _Allocator&) [with _InputIterator = mlpack::DiagonalGMM*; _ForwardIterator = mlpack::DiagonalGMM*; _Allocator = allocator<mlpack::DiagonalGMM>]’ at /usr/include/c++/13/bits/stl_uninitialized.h:399:2,
inlined from ‘void std::vector<_Tp, _Alloc>::_M_default_append(size_type) [with _Tp = mlpack::DiagonalGMM; _Alloc = std::allocator<mlpack::DiagonalGMM>]’ at /usr/include/c++/13/bits/vector.tcc:687:48:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const mlpack::DiagonalGaussianDistribution*, std::vector<mlpack::DiagonalGaussianDistribution> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 7%] Linking CXX executable ../../../bin/mlpack_hmm_train
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_hmm_train.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_hmm_train.dir/hmm/hmm_train_main.cpp.o -o ../../../bin/mlpack_hmm_train /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 7%] Built target mlpack_hmm_train
make -f src/mlpack/methods/CMakeFiles/mlpack_hmm_generate.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hmm_generate.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_hmm_generate.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_hmm_generate.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hmm_generate.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 8%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_hmm_generate.dir/hmm/hmm_generate_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_hmm_generate.dir/hmm/hmm_generate_main.cpp.o -MF CMakeFiles/mlpack_hmm_generate.dir/hmm/hmm_generate_main.cpp.o.d -o CMakeFiles/mlpack_hmm_generate.dir/hmm/hmm_generate_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_generate_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_generate_main.cpp:14:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/em_fit.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_generate_main.cpp:22:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In constructor ‘mlpack::HMMModel::HMMModel(mlpack::HMMType)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
57 | discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
59 | gaussianHMM = new HMM<GaussianDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
61 | gmmHMM = new HMM<GMM>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
63 | diagGMMHMM = new HMM<DiagonalGMM>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In copy constructor ‘mlpack::HMMModel::HMMModel(const mlpack::HMMModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
76 | new HMM<DiscreteDistribution>(*other.discreteHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
79 | new HMM<GaussianDistribution>(*other.gaussianHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
81 | gmmHMM = new HMM<GMM>(*other.gmmHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
83 | diagGMMHMM = new HMM<DiagonalGMM>(*other.diagGMMHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In constructor ‘mlpack::HMMModel::HMMModel(mlpack::HMMModel&&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
95 | other.discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In member function ‘mlpack::HMMModel& mlpack::HMMModel::operator=(const mlpack::HMMModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
120 | new HMM<DiscreteDistribution>(*other.discreteHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
123 | new HMM<GaussianDistribution>(*other.gaussianHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
125 | gmmHMM = new HMM<GMM>(*other.gmmHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
127 | diagGMMHMM = new HMM<DiagonalGMM>(*other.diagGMMHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In member function ‘mlpack::HMMModel& mlpack::HMMModel::operator=(mlpack::HMMModel&&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
144 | other.discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 8%] Linking CXX executable ../../../bin/mlpack_hmm_generate
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_hmm_generate.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_hmm_generate.dir/hmm/hmm_generate_main.cpp.o -o ../../../bin/mlpack_hmm_generate /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 8%] Built target mlpack_hmm_generate
make -f src/mlpack/methods/CMakeFiles/mlpack_hmm_loglik.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hmm_loglik.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_hmm_loglik.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_hmm_loglik.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hmm_loglik.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 8%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_hmm_loglik.dir/hmm/hmm_loglik_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_hmm_loglik.dir/hmm/hmm_loglik_main.cpp.o -MF CMakeFiles/mlpack_hmm_loglik.dir/hmm/hmm_loglik_main.cpp.o.d -o CMakeFiles/mlpack_hmm_loglik.dir/hmm/hmm_loglik_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_loglik_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_loglik_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/em_fit.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_loglik_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In constructor ‘mlpack::HMMModel::HMMModel(mlpack::HMMType)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
57 | discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
59 | gaussianHMM = new HMM<GaussianDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
61 | gmmHMM = new HMM<GMM>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
63 | diagGMMHMM = new HMM<DiagonalGMM>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In copy constructor ‘mlpack::HMMModel::HMMModel(const mlpack::HMMModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
76 | new HMM<DiscreteDistribution>(*other.discreteHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
79 | new HMM<GaussianDistribution>(*other.gaussianHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
81 | gmmHMM = new HMM<GMM>(*other.gmmHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
83 | diagGMMHMM = new HMM<DiagonalGMM>(*other.diagGMMHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In constructor ‘mlpack::HMMModel::HMMModel(mlpack::HMMModel&&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
95 | other.discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In member function ‘mlpack::HMMModel& mlpack::HMMModel::operator=(const mlpack::HMMModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
120 | new HMM<DiscreteDistribution>(*other.discreteHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
123 | new HMM<GaussianDistribution>(*other.gaussianHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
125 | gmmHMM = new HMM<GMM>(*other.gmmHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
127 | diagGMMHMM = new HMM<DiagonalGMM>(*other.diagGMMHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In member function ‘mlpack::HMMModel& mlpack::HMMModel::operator=(mlpack::HMMModel&&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
144 | other.discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 9%] Linking CXX executable ../../../bin/mlpack_hmm_loglik
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_hmm_loglik.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_hmm_loglik.dir/hmm/hmm_loglik_main.cpp.o -o ../../../bin/mlpack_hmm_loglik /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 9%] Built target mlpack_hmm_loglik
make -f src/mlpack/methods/CMakeFiles/mlpack_hmm_viterbi.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hmm_viterbi.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_hmm_viterbi.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_hmm_viterbi.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hmm_viterbi.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 9%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_hmm_viterbi.dir/hmm/hmm_viterbi_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_hmm_viterbi.dir/hmm/hmm_viterbi_main.cpp.o -MF CMakeFiles/mlpack_hmm_viterbi.dir/hmm/hmm_viterbi_main.cpp.o.d -o CMakeFiles/mlpack_hmm_viterbi.dir/hmm/hmm_viterbi_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_viterbi_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_viterbi_main.cpp:13:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/em_fit.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/gmm/gmm.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_viterbi_main.cpp:21:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In constructor ‘mlpack::HMMModel::HMMModel(mlpack::HMMType)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
57 | discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:57:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
59 | gaussianHMM = new HMM<GaussianDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:59:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
61 | gmmHMM = new HMM<GMM>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:61:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
63 | diagGMMHMM = new HMM<DiagonalGMM>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:63:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In copy constructor ‘mlpack::HMMModel::HMMModel(const mlpack::HMMModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
76 | new HMM<DiscreteDistribution>(*other.discreteHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:76:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
79 | new HMM<GaussianDistribution>(*other.gaussianHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:79:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
81 | gmmHMM = new HMM<GMM>(*other.gmmHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:81:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
83 | diagGMMHMM = new HMM<DiagonalGMM>(*other.diagGMMHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:83:58: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In constructor ‘mlpack::HMMModel::HMMModel(mlpack::HMMModel&&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
95 | other.discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:95:55: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In member function ‘mlpack::HMMModel& mlpack::HMMModel::operator=(const mlpack::HMMModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
120 | new HMM<DiscreteDistribution>(*other.discreteHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:120:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GaussianDistribution>’ with extended alignment 16 [-Waligned-new=]
123 | new HMM<GaussianDistribution>(*other.gaussianHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:123:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: warning: ‘new’ of type ‘mlpack::HMM<mlpack::GMM>’ with extended alignment 16 [-Waligned-new=]
125 | gmmHMM = new HMM<GMM>(*other.gmmHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:125:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiagonalGMM>’ with extended alignment 16 [-Waligned-new=]
127 | diagGMMHMM = new HMM<DiagonalGMM>(*other.diagGMMHMM);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:127:58: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp: In member function ‘mlpack::HMMModel& mlpack::HMMModel::operator=(mlpack::HMMModel&&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: warning: ‘new’ of type ‘mlpack::HMM<mlpack::DiscreteDistribution>’ with extended alignment 16 [-Waligned-new=]
144 | other.discreteHMM = new HMM<DiscreteDistribution>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hmm/hmm_model.hpp:144:57: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 10%] Linking CXX executable ../../../bin/mlpack_hmm_viterbi
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_hmm_viterbi.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_hmm_viterbi.dir/hmm/hmm_viterbi_main.cpp.o -o ../../../bin/mlpack_hmm_viterbi /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 10%] Built target mlpack_hmm_viterbi
make -f src/mlpack/methods/CMakeFiles/mlpack_hoeffding_tree.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hoeffding_tree.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_hoeffding_tree.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_hoeffding_tree.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_hoeffding_tree.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 10%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_hoeffding_tree.dir/hoeffding_trees/hoeffding_tree_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_hoeffding_tree.dir/hoeffding_trees/hoeffding_tree_main.cpp.o -MF CMakeFiles/mlpack_hoeffding_tree.dir/hoeffding_trees/hoeffding_tree_main.cpp.o.d -o CMakeFiles/mlpack_hoeffding_tree.dir/hoeffding_trees/hoeffding_tree_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model.hpp:223,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_main.cpp:22:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp: In copy constructor ‘mlpack::HoeffdingTreeModel::HoeffdingTreeModel(const mlpack::HoeffdingTreeModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:34:33: warning: ‘new’ of type ‘mlpack::HoeffdingTreeModel::GiniHoeffdingTreeType’ {aka ‘mlpack::HoeffdingTree<mlpack::GiniImpurity, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’} with extended alignment 16 [-Waligned-new=]
34 | *other.giniHoeffdingTree) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:34:33: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:34:33: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:38:33: warning: ‘new’ of type ‘mlpack::HoeffdingTreeModel::InfoHoeffdingTreeType’ {aka ‘mlpack::HoeffdingTree<mlpack::HoeffdingInformationGain, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’} with extended alignment 16 [-Waligned-new=]
38 | *other.infoHoeffdingTree) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:38:33: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:38:33: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp: In member function ‘mlpack::HoeffdingTreeModel& mlpack::HoeffdingTreeModel::operator=(const mlpack::HoeffdingTreeModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:81:77: warning: ‘new’ of type ‘mlpack::HoeffdingTreeModel::GiniHoeffdingTreeType’ {aka ‘mlpack::HoeffdingTree<mlpack::GiniImpurity, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’} with extended alignment 16 [-Waligned-new=]
81 | giniHoeffdingTree = new GiniHoeffdingTreeType(*other.giniHoeffdingTree);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:81:77: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:81:77: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:85:77: warning: ‘new’ of type ‘mlpack::HoeffdingTreeModel::InfoHoeffdingTreeType’ {aka ‘mlpack::HoeffdingTree<mlpack::HoeffdingInformationGain, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’} with extended alignment 16 [-Waligned-new=]
85 | infoHoeffdingTree = new InfoHoeffdingTreeType(*other.infoHoeffdingTree);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:85:77: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:85:77: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp: In member function ‘void mlpack::HoeffdingTreeModel::BuildModel(const arma::mat&, const mlpack::data::DatasetInfo&, const arma::Row<unsigned int>&, size_t, bool, double, size_t, size_t, size_t, size_t, size_t)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:161:62: warning: ‘new’ of type ‘mlpack::HoeffdingTreeModel::GiniHoeffdingTreeType’ {aka ‘mlpack::HoeffdingTree<mlpack::GiniImpurity, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’} with extended alignment 16 [-Waligned-new=]
161 | HoeffdingCategoricalSplit<GiniImpurity>(0, 0), ns);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:161:62: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:161:62: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:180:74: warning: ‘new’ of type ‘mlpack::HoeffdingTreeModel::InfoHoeffdingTreeType’ {aka ‘mlpack::HoeffdingTree<mlpack::HoeffdingInformationGain, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’} with extended alignment 16 [-Waligned-new=]
180 | HoeffdingCategoricalSplit<HoeffdingInformationGain>(0, 0), ns);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:180:74: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:180:74: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree.hpp:434,
from /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp: In instantiation of ‘mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::HoeffdingTree(const mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>&) [with FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:34:33: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:180:24: warning: ‘new’ of type ‘mlpack::HoeffdingTree<mlpack::GiniImpurity, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’ with extended alignment 16 [-Waligned-new=]
180 | children.push_back(new HoeffdingTree(*other.children[i]));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:180:24: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:180:24: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp: In instantiation of ‘mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::HoeffdingTree(const mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>&) [with FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:38:33: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:180:24: warning: ‘new’ of type ‘mlpack::HoeffdingTree<mlpack::HoeffdingInformationGain, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:180:24: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:180:24: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp: In instantiation of ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::CreateChildren() [with FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:449:9: required from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::Train(const VecType&, size_t) [with VecType = arma::subview_col<double>; FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:958:12: required from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::TrainInternal(const MatType&, const arma::Row<unsigned int>&, bool) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:371:16: required from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::Train(const MatType&, const arma::Row<unsigned int>&, bool, bool, size_t) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:201:31: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:786:26: warning: ‘new’ of type ‘mlpack::HoeffdingTree<mlpack::GiniImpurity, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’ with extended alignment 16 [-Waligned-new=]
786 | children.push_back(new HoeffdingTree(*datasetInfo, numClasses,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
787 | successProbability, maxSamples, checkInterval, minSamples,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
788 | CategoricalSplitType<FitnessFunction>(0, numClasses),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
789 | numericSplits[0], dimensionMappings, false));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:786:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:786:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:794:26: warning: ‘new’ of type ‘mlpack::HoeffdingTree<mlpack::GiniImpurity, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’ with extended alignment 16 [-Waligned-new=]
794 | children.push_back(new HoeffdingTree(*datasetInfo, numClasses,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
795 | successProbability, maxSamples, checkInterval, minSamples,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
796 | categoricalSplits[0], NumericSplitType<FitnessFunction>(numClasses),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
797 | dimensionMappings, false));
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:794:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:794:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:802:26: warning: ‘new’ of type ‘mlpack::HoeffdingTree<mlpack::GiniImpurity, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’ with extended alignment 16 [-Waligned-new=]
802 | children.push_back(new HoeffdingTree(*datasetInfo, numClasses,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
803 | successProbability, maxSamples, checkInterval, minSamples,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
804 | categoricalSplits[0], numericSplits[0], dimensionMappings, false));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:802:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:802:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp: In instantiation of ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::CreateChildren() [with FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:449:9: required from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::Train(const VecType&, size_t) [with VecType = arma::subview_col<double>; FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:958:12: required from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::TrainInternal(const MatType&, const arma::Row<unsigned int>&, bool) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:371:16: required from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::Train(const MatType&, const arma::Row<unsigned int>&, bool, bool, size_t) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_model_impl.hpp:209:31: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:786:26: warning: ‘new’ of type ‘mlpack::HoeffdingTree<mlpack::HoeffdingInformationGain, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’ with extended alignment 16 [-Waligned-new=]
786 | children.push_back(new HoeffdingTree(*datasetInfo, numClasses,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
787 | successProbability, maxSamples, checkInterval, minSamples,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
788 | CategoricalSplitType<FitnessFunction>(0, numClasses),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
789 | numericSplits[0], dimensionMappings, false));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:786:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:786:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:794:26: warning: ‘new’ of type ‘mlpack::HoeffdingTree<mlpack::HoeffdingInformationGain, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’ with extended alignment 16 [-Waligned-new=]
794 | children.push_back(new HoeffdingTree(*datasetInfo, numClasses,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
795 | successProbability, maxSamples, checkInterval, minSamples,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
796 | categoricalSplits[0], NumericSplitType<FitnessFunction>(numClasses),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
797 | dimensionMappings, false));
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:794:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:794:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:802:26: warning: ‘new’ of type ‘mlpack::HoeffdingTree<mlpack::HoeffdingInformationGain, mlpack::HoeffdingDoubleNumericSplit, mlpack::HoeffdingCategoricalSplit>’ with extended alignment 16 [-Waligned-new=]
802 | children.push_back(new HoeffdingTree(*datasetInfo, numClasses,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
803 | successProbability, maxSamples, checkInterval, minSamples,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
804 | categoricalSplits[0], numericSplits[0], dimensionMappings, false));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:802:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:802:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double>}; _Tp = mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double>; _Alloc = std::allocator<mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double>}; _Tp = mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double>; _Alloc = std::allocator<mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double> >]’:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double>*, std::vector<mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::HoeffdingNumericSplit<mlpack::GiniImpurity, double> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::ResetTree(const CategoricalSplitType<FitnessFunction>&, const NumericSplitType<FitnessFunction>&) [with FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:1041:34:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::HoeffdingTree(const mlpack::data::DatasetInfo&, size_t, double, size_t, size_t, size_t, const CategoricalSplitType<FitnessFunction>&, const NumericSplitType<FitnessFunction>&, std::unordered_map<unsigned int, std::pair<unsigned int, unsigned int> >*, bool) [with FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:112:36:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>}; _Tp = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>; _Alloc = std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>}; _Tp = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>; _Alloc = std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> >]’:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>*, std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::ResetTree(const CategoricalSplitType<FitnessFunction>&, const NumericSplitType<FitnessFunction>&) [with FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::BinaryDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:1041:34:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::HoeffdingTree(const mlpack::data::DatasetInfo&, size_t, double, size_t, size_t, size_t, const CategoricalSplitType<FitnessFunction>&, const NumericSplitType<FitnessFunction>&, std::unordered_map<unsigned int, std::pair<unsigned int, unsigned int> >*, bool) [with FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::BinaryDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:112:36:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::GiniImpurity> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double>}; _Tp = mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double>; _Alloc = std::allocator<mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double>}; _Tp = mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double>; _Alloc = std::allocator<mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double> >]’:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double>*, std::vector<mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::HoeffdingNumericSplit<mlpack::HoeffdingInformationGain, double> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::ResetTree(const CategoricalSplitType<FitnessFunction>&, const NumericSplitType<FitnessFunction>&) [with FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:1041:34:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::HoeffdingTree(const mlpack::data::DatasetInfo&, size_t, double, size_t, size_t, size_t, const CategoricalSplitType<FitnessFunction>&, const NumericSplitType<FitnessFunction>&, std::unordered_map<unsigned int, std::pair<unsigned int, unsigned int> >*, bool) [with FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::HoeffdingDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:112:36:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>}; _Tp = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>; _Alloc = std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>}; _Tp = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>; _Alloc = std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> >]’:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>*, std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::ResetTree(const CategoricalSplitType<FitnessFunction>&, const NumericSplitType<FitnessFunction>&) [with FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::BinaryDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:1041:34:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>}; _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>; _Alloc = std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::HoeffdingTree(const mlpack::data::DatasetInfo&, size_t, double, size_t, size_t, size_t, const CategoricalSplitType<FitnessFunction>&, const NumericSplitType<FitnessFunction>&, std::unordered_map<unsigned int, std::pair<unsigned int, unsigned int> >*, bool) [with FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::BinaryDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:112:36:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>*, std::vector<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain>, std::allocator<mlpack::HoeffdingCategoricalSplit<mlpack::HoeffdingInformationGain> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_equal(const_iterator, _Args&& ...) [with _Args = {double, unsigned int}; _Key = double; _Val = std::pair<const double, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const double, unsigned int> >; _Compare = std::less<double>; _Alloc = std::allocator<std::pair<const double, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2473:7: note: parameter passing for argument of type ‘std::_Rb_tree<double, std::pair<const double, unsigned int>, std::_Select1st<std::pair<const double, unsigned int> >, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’ changed in GCC 7.1
2473 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:64:
In member function ‘std::multimap<_Key, _Tp, _Compare, _Alloc>::iterator std::multimap<_Key, _Tp, _Compare, _Alloc>::emplace_hint(const_iterator, _Args&& ...) [with _Args = {double, unsigned int}; _Key = double; _Tp = unsigned int; _Compare = std::less<double>; _Alloc = std::allocator<std::pair<const double, unsigned int> >]’,
inlined from ‘void cereal::load(Archive&, Map<Args ...>&) [with Archive = XMLInputArchive; Map = std::multimap; Args = {double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> >}; <template-parameter-1-4> = unsigned int]’ at /<<PKGBUILDDIR>>/src/mlpack/core/cereal/pair_associative_container.hpp:76:30,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&}; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void cereal::load(XMLInputArchive&, NameValuePair<T>&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&]’ at /usr/include/cereal/archives/xml.hpp:902:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>}; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::BinaryNumericSplit<FitnessFunction, ObservationType>::serialize(Archive&, uint32_t) [with Archive = cereal::XMLInputArchive; FitnessFunction = mlpack::HoeffdingInformationGain; ObservationType = double]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/binary_numeric_split_impl.hpp:177:5,
inlined from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::XMLInputArchive; T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>]’ at /usr/include/cereal/access.hpp:275:48,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:1038:33,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>&; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>&}; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(((! cereal::traits::is_input_serializable<cereal::BinaryData<T>, Archive>::value) || (! std::is_arithmetic<T>::value)) && (! std::is_same<T, bool>::value)), void>::type cereal::load(Archive&, std::vector<T, A>&) [with Archive = XMLInputArchive; T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>; A = std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> >]’ at /usr/include/cereal/types/vector.hpp:83:9:
/usr/include/c++/13/bits/stl_multimap.h:526:44: note: parameter passing for argument of type ‘std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’ {aka ‘std::_Rb_tree<double, std::pair<const double, unsigned int>, std::_Select1st<std::pair<const double, unsigned int> >, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’} changed in GCC 7.1
526 | return _M_t._M_emplace_hint_equal(__pos,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
527 | std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::multimap<_Key, _Tp, _Compare, _Alloc>::iterator std::multimap<_Key, _Tp, _Compare, _Alloc>::emplace_hint(const_iterator, _Args&& ...) [with _Args = {double, unsigned int}; _Key = double; _Tp = unsigned int; _Compare = std::less<double>; _Alloc = std::allocator<std::pair<const double, unsigned int> >]’,
inlined from ‘void cereal::load(Archive&, Map<Args ...>&) [with Archive = XMLInputArchive; Map = std::multimap; Args = {double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> >}; <template-parameter-1-4> = unsigned int]’ at /<<PKGBUILDDIR>>/src/mlpack/core/cereal/pair_associative_container.hpp:76:30,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&}; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void cereal::load(XMLInputArchive&, NameValuePair<T>&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&]’ at /usr/include/cereal/archives/xml.hpp:902:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>}; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::BinaryNumericSplit<FitnessFunction, ObservationType>::serialize(Archive&, uint32_t) [with Archive = cereal::XMLInputArchive; FitnessFunction = mlpack::GiniImpurity; ObservationType = double]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/binary_numeric_split_impl.hpp:177:5,
inlined from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::XMLInputArchive; T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>]’ at /usr/include/cereal/access.hpp:275:48,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:1038:33,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>&; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>&}; ArchiveType = cereal::XMLInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(((! cereal::traits::is_input_serializable<cereal::BinaryData<T>, Archive>::value) || (! std::is_arithmetic<T>::value)) && (! std::is_same<T, bool>::value)), void>::type cereal::load(Archive&, std::vector<T, A>&) [with Archive = XMLInputArchive; T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>; A = std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> >]’ at /usr/include/cereal/types/vector.hpp:83:9:
/usr/include/c++/13/bits/stl_multimap.h:526:44: note: parameter passing for argument of type ‘std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’ {aka ‘std::_Rb_tree<double, std::pair<const double, unsigned int>, std::_Select1st<std::pair<const double, unsigned int> >, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’} changed in GCC 7.1
526 | return _M_t._M_emplace_hint_equal(__pos,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
527 | std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::multimap<_Key, _Tp, _Compare, _Alloc>::iterator std::multimap<_Key, _Tp, _Compare, _Alloc>::emplace_hint(const_iterator, _Args&& ...) [with _Args = {double, unsigned int}; _Key = double; _Tp = unsigned int; _Compare = std::less<double>; _Alloc = std::allocator<std::pair<const double, unsigned int> >]’,
inlined from ‘void cereal::load(Archive&, Map<Args ...>&) [with Archive = BinaryInputArchive; Map = std::multimap; Args = {double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> >}; <template-parameter-1-4> = unsigned int]’ at /<<PKGBUILDDIR>>/src/mlpack/core/cereal/pair_associative_container.hpp:76:30,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&]’ at /usr/include/cereal/archives/binary.hpp:136:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:925:39,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::BinaryNumericSplit<FitnessFunction, ObservationType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; FitnessFunction = mlpack::HoeffdingInformationGain; ObservationType = double]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/binary_numeric_split_impl.hpp:177:5,
inlined from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>]’ at /usr/include/cereal/access.hpp:275:48,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:1038:33,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(((! cereal::traits::is_input_serializable<cereal::BinaryData<T>, Archive>::value) || (! std::is_arithmetic<T>::value)) && (! std::is_same<T, bool>::value)), void>::type cereal::load(Archive&, std::vector<T, A>&) [with Archive = BinaryInputArchive; T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>; A = std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> >]’ at /usr/include/cereal/types/vector.hpp:83:9,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&]’ at /usr/include/cereal/archives/binary.hpp:136:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:925:39,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::BinaryDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:898:7:
/usr/include/c++/13/bits/stl_multimap.h:526:44: note: parameter passing for argument of type ‘std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’ {aka ‘std::_Rb_tree<double, std::pair<const double, unsigned int>, std::_Select1st<std::pair<const double, unsigned int> >, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’} changed in GCC 7.1
526 | return _M_t._M_emplace_hint_equal(__pos,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
527 | std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::multimap<_Key, _Tp, _Compare, _Alloc>::iterator std::multimap<_Key, _Tp, _Compare, _Alloc>::emplace_hint(const_iterator, _Args&& ...) [with _Args = {double, unsigned int}; _Key = double; _Tp = unsigned int; _Compare = std::less<double>; _Alloc = std::allocator<std::pair<const double, unsigned int> >]’,
inlined from ‘void cereal::load(Archive&, Map<Args ...>&) [with Archive = BinaryInputArchive; Map = std::multimap; Args = {double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> >}; <template-parameter-1-4> = unsigned int]’ at /<<PKGBUILDDIR>>/src/mlpack/core/cereal/pair_associative_container.hpp:76:30,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&]’ at /usr/include/cereal/archives/binary.hpp:136:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:925:39,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::BinaryNumericSplit<FitnessFunction, ObservationType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; FitnessFunction = mlpack::GiniImpurity; ObservationType = double]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/binary_numeric_split_impl.hpp:177:5,
inlined from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>]’ at /usr/include/cereal/access.hpp:275:48,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:1038:33,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(((! cereal::traits::is_input_serializable<cereal::BinaryData<T>, Archive>::value) || (! std::is_arithmetic<T>::value)) && (! std::is_same<T, bool>::value)), void>::type cereal::load(Archive&, std::vector<T, A>&) [with Archive = BinaryInputArchive; T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>; A = std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> >]’ at /usr/include/cereal/types/vector.hpp:83:9,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&]’ at /usr/include/cereal/archives/binary.hpp:136:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:925:39,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::BinaryDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:898:7:
/usr/include/c++/13/bits/stl_multimap.h:526:44: note: parameter passing for argument of type ‘std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’ {aka ‘std::_Rb_tree<double, std::pair<const double, unsigned int>, std::_Select1st<std::pair<const double, unsigned int> >, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’} changed in GCC 7.1
526 | return _M_t._M_emplace_hint_equal(__pos,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
527 | std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::multimap<_Key, _Tp, _Compare, _Alloc>::iterator std::multimap<_Key, _Tp, _Compare, _Alloc>::emplace_hint(const_iterator, _Args&& ...) [with _Args = {double, unsigned int}; _Key = double; _Tp = unsigned int; _Compare = std::less<double>; _Alloc = std::allocator<std::pair<const double, unsigned int> >]’,
inlined from ‘void cereal::load(Archive&, Map<Args ...>&) [with Archive = JSONInputArchive; Map = std::multimap; Args = {double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> >}; <template-parameter-1-4> = unsigned int]’ at /<<PKGBUILDDIR>>/src/mlpack/core/cereal/pair_associative_container.hpp:76:30,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void cereal::load(JSONInputArchive&, NameValuePair<T>&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&]’ at /usr/include/cereal/archives/json.hpp:956:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::BinaryNumericSplit<FitnessFunction, ObservationType>::serialize(Archive&, uint32_t) [with Archive = cereal::JSONInputArchive; FitnessFunction = mlpack::HoeffdingInformationGain; ObservationType = double]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/binary_numeric_split_impl.hpp:177:5,
inlined from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::JSONInputArchive; T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>]’ at /usr/include/cereal/access.hpp:275:48,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:1038:33,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>&; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>&}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(((! cereal::traits::is_input_serializable<cereal::BinaryData<T>, Archive>::value) || (! std::is_arithmetic<T>::value)) && (! std::is_same<T, bool>::value)), void>::type cereal::load(Archive&, std::vector<T, A>&) [with Archive = JSONInputArchive; T = mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>; A = std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> >]’ at /usr/include/cereal/types/vector.hpp:83:9,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void cereal::load(JSONInputArchive&, NameValuePair<T>&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&]’ at /usr/include/cereal/archives/json.hpp:956:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&>; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::HoeffdingInformationGain, double> > >&>}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::serialize(Archive&, uint32_t) [with Archive = cereal::JSONInputArchive; FitnessFunction = mlpack::HoeffdingInformationGain; NumericSplitType = mlpack::BinaryDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:898:7:
/usr/include/c++/13/bits/stl_multimap.h:526:44: note: parameter passing for argument of type ‘std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’ {aka ‘std::_Rb_tree<double, std::pair<const double, unsigned int>, std::_Select1st<std::pair<const double, unsigned int> >, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’} changed in GCC 7.1
526 | return _M_t._M_emplace_hint_equal(__pos,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
527 | std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::multimap<_Key, _Tp, _Compare, _Alloc>::iterator std::multimap<_Key, _Tp, _Compare, _Alloc>::emplace_hint(const_iterator, _Args&& ...) [with _Args = {double, unsigned int}; _Key = double; _Tp = unsigned int; _Compare = std::less<double>; _Alloc = std::allocator<std::pair<const double, unsigned int> >]’,
inlined from ‘void cereal::load(Archive&, Map<Args ...>&) [with Archive = JSONInputArchive; Map = std::multimap; Args = {double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> >}; <template-parameter-1-4> = unsigned int]’ at /<<PKGBUILDDIR>>/src/mlpack/core/cereal/pair_associative_container.hpp:76:30,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void cereal::load(JSONInputArchive&, NameValuePair<T>&) [with T = std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&]’ at /usr/include/cereal/archives/json.hpp:956:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >&>}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::BinaryNumericSplit<FitnessFunction, ObservationType>::serialize(Archive&, uint32_t) [with Archive = cereal::JSONInputArchive; FitnessFunction = mlpack::GiniImpurity; ObservationType = double]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/binary_numeric_split_impl.hpp:177:5,
inlined from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::JSONInputArchive; T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>]’ at /usr/include/cereal/access.hpp:275:48,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:1038:33,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>&; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>&}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘typename std::enable_if<(((! cereal::traits::is_input_serializable<cereal::BinaryData<T>, Archive>::value) || (! std::is_arithmetic<T>::value)) && (! std::is_same<T, bool>::value)), void>::type cereal::load(Archive&, std::vector<T, A>&) [with Archive = JSONInputArchive; T = mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>; A = std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> >]’ at /usr/include/cereal/types/vector.hpp:83:9,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void cereal::load(JSONInputArchive&, NameValuePair<T>&) [with T = std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&]’ at /usr/include/cereal/archives/json.hpp:956:7,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:941:34,
inlined from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&>; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:853:26,
inlined from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::vector<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double>, std::allocator<mlpack::BinaryNumericSplit<mlpack::GiniImpurity, double> > >&>}; ArchiveType = cereal::JSONInputArchive; unsigned int Flags = 0]’ at /usr/include/cereal/cereal.hpp:730:16,
inlined from ‘void mlpack::HoeffdingTree<FitnessFunction, NumericSplitType, CategoricalSplitType>::serialize(Archive&, uint32_t) [with Archive = cereal::JSONInputArchive; FitnessFunction = mlpack::GiniImpurity; NumericSplitType = mlpack::BinaryDoubleNumericSplit; CategoricalSplitType = mlpack::HoeffdingCategoricalSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/hoeffding_trees/hoeffding_tree_impl.hpp:898:7:
/usr/include/c++/13/bits/stl_multimap.h:526:44: note: parameter passing for argument of type ‘std::multimap<double, unsigned int, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’ {aka ‘std::_Rb_tree<double, std::pair<const double, unsigned int>, std::_Select1st<std::pair<const double, unsigned int> >, std::less<double>, std::allocator<std::pair<const double, unsigned int> > >::const_iterator’} changed in GCC 7.1
526 | return _M_t._M_emplace_hint_equal(__pos,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
527 | std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 10%] Linking CXX executable ../../../bin/mlpack_hoeffding_tree
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_hoeffding_tree.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_hoeffding_tree.dir/hoeffding_trees/hoeffding_tree_main.cpp.o -o ../../../bin/mlpack_hoeffding_tree /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 10%] Built target mlpack_hoeffding_tree
make -f src/mlpack/methods/CMakeFiles/mlpack_kde.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_kde.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_kde.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_kde.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_kde.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 10%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_kde.dir/kde/kde_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_kde.dir/kde/kde_main.cpp.o -MF CMakeFiles/mlpack_kde.dir/kde/kde_main.cpp.o.d -o CMakeFiles/mlpack_kde.dir/kde/kde_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree.hpp:468,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:21:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree() [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>]’:
/usr/include/cereal/access.hpp:317:16: required from ‘static T* cereal::access::construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >]’
/usr/include/cereal/details/traits.hpp:1364:46: required from ‘static T* cereal::detail::Construct<T, A, false, false, false, false>::load_andor_construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >; A = cereal::BinaryInputArchive]’
/usr/include/cereal/types/memory.hpp:411:101: required from ‘typename std::enable_if<(! cereal::traits::has_load_and_construct<T, Archive>::value), void>::type cereal::load(Archive&, memory_detail::PtrWrapper<std::unique_ptr<T, D>&>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > >; typename std::enable_if<(! traits::has_load_and_construct<T, Archive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/types/memory.hpp:253:7: required from ‘typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type cereal::load(Archive&, std::unique_ptr<T, D>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > >; typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/cereal/pointer_wrapper.hpp:65:7: required from ‘void cereal::PointerWrapper<T>::load(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:287:43: required from ‘static decltype (t.load(ar, version)) cereal::access::member_load(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > >; decltype (t.load(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1058:28: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > >; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> > >}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:765:5: required from ‘void mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; KernelType = mlpack::GaussianKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:211:7: required from ‘void mlpack::KDEWrapper<KernelType, TreeType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; KernelType = mlpack::GaussianKernel; TreeType = mlpack::Octree; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::KDEWrapper<mlpack::GaussianKernel, mlpack::Octree>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::KDEWrapper<mlpack::GaussianKernel, mlpack::Octree>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::KDEWrapper<mlpack::GaussianKernel, mlpack::Octree>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::KDEWrapper<mlpack::GaussianKernel, mlpack::Octree>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::KDEWrapper<mlpack::GaussianKernel, mlpack::Octree>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::KDEWrapper<mlpack::GaussianKernel, mlpack::Octree>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::KDEWrapper<mlpack::GaussianKernel, mlpack::Octree>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::KDEWrapper<mlpack::GaussianKernel, mlpack::Octree>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:410:11: required from ‘void mlpack::SerializationHelper(Archive&, KDEWrapperBase*, KDEModel::KernelTypes) [with TreeType = Octree; Archive = cereal::BinaryInputArchive]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:487:34: required from ‘void mlpack::KDEModel::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::KDEModel; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::KDEModel; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::KDEModel&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::KDEModel&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::KDEModel&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::KDEModel&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::KDEModel&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::KDEModel&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/data/load_model_impl.hpp:95:9: required from ‘bool mlpack::data::Load(const std::string&, const std::string&, T&, bool, format) [with T = mlpack::KDEModel; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:124:15: required from ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::KDEModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::KDEModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::KDEModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_main.cpp:138:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
475 | dataset(new MatType()),
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde.hpp:355,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp: In instantiation of ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::TriangularKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: warning: ‘new’ of type ‘mlpack::KDE<mlpack::TriangularKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
94 | referenceTree = new Tree(*other.referenceTree);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:26:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, KDEStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:353:38: required from ‘void mlpack::KDEWrapper<KernelType, TreeType>::Evaluate(mlpack::util::Timers&, arma::mat&&, arma::vec&) [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:342:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp: In instantiation of ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::SphericalKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::SphericalKernel; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: warning: ‘new’ of type ‘mlpack::KDE<mlpack::SphericalKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
94 | referenceTree = new Tree(*other.referenceTree);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp: In instantiation of ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::LaplacianKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::LaplacianKernel; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: warning: ‘new’ of type ‘mlpack::KDE<mlpack::LaplacianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp: In instantiation of ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::EpanechnikovKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::EpanechnikovKernel; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: warning: ‘new’ of type ‘mlpack::KDE<mlpack::EpanechnikovKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp: In instantiation of ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::GaussianKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::GaussianKernel; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: warning: ‘new’ of type ‘mlpack::KDE<mlpack::GaussianKernel, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp:638,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:20,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:22:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: required from ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::TriangularKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, KDEStat, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:353:38: required from ‘void mlpack::KDEWrapper<KernelType, TreeType>::Evaluate(mlpack::util::Timers&, arma::mat&&, arma::vec&) [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::RTree; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:342:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const mlpack::Octree<MetricType, StatisticType, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: required from ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::TriangularKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
348 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = Octree<LMetric<2, true>, KDEStat, arma::Mat<double> >; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:353:38: required from ‘void mlpack::KDEWrapper<KernelType, TreeType>::Evaluate(mlpack::util::Timers&, arma::mat&&, arma::vec&) [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:342:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
192 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree.hpp:580,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: required from ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::TriangularKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
509 | new MatType(*other.dataset) : other.dataset),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, ElemType) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = CoverTree<LMetric<2, true>, KDEStat, arma::Mat<double>, FirstPointIsRoot>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:353:38: required from ‘void mlpack::KDEWrapper<KernelType, TreeType>::Evaluate(mlpack::util::Timers&, arma::mat&&, arma::vec&) [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:342:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
239 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: required from ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::TriangularKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::BallTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, KDEStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:353:38: required from ‘void mlpack::KDEWrapper<KernelType, TreeType>::Evaluate(mlpack::util::Timers&, arma::mat&&, arma::vec&) [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:342:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_impl.hpp:94:23: required from ‘mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::KDE(const mlpack::KDE<KernelType, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with KernelType = mlpack::TriangularKernel; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:138:7: required from ‘mlpack::KDEWrapper<KernelType, TreeType>* mlpack::KDEWrapper<KernelType, TreeType>::Clone() const [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model.hpp:152:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, KDEStat, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:353:38: required from ‘void mlpack::KDEWrapper<KernelType, TreeType>::Evaluate(mlpack::util::Timers&, arma::mat&&, arma::vec&) [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:342:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, KDEStat, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:353:38: required from ‘void mlpack::KDEWrapper<KernelType, TreeType>::Evaluate(mlpack::util::Timers&, arma::mat&&, arma::vec&) [with KernelType = mlpack::TriangularKernel; TreeType = mlpack::BallTree; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kde/kde_model_impl.hpp:342:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:73:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
/usr/include/c++/13/bits/stl_vector.h: In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDECleanRules<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDECleanRules<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::TriangularKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::SphericalKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::LaplacianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::EpanechnikovKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::KDEStat; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::KDERules<mlpack::LMetric<2, true>, mlpack::GaussianKernel, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::KDEStat, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 10%] Linking CXX executable ../../../bin/mlpack_kde
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_kde.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_kde.dir/kde/kde_main.cpp.o -o ../../../bin/mlpack_kde /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 10%] Built target mlpack_kde
make -f src/mlpack/methods/CMakeFiles/mlpack_kernel_pca.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_kernel_pca.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_kernel_pca.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_kernel_pca.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_kernel_pca.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 11%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_kernel_pca.dir/kernel_pca/kernel_pca_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_kernel_pca.dir/kernel_pca/kernel_pca_main.cpp.o -MF CMakeFiles/mlpack_kernel_pca.dir/kernel_pca/kernel_pca_main.cpp.o.d -o CMakeFiles/mlpack_kernel_pca.dir/kernel_pca/kernel_pca_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/kernel_pca/kernel_pca_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kernel_pca/kernel_pca_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/nystroem_method.hpp:20,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kernel_pca/kernel_pca_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp: In static member function ‘static const arma::mat* mlpack::KMeansSelection<ClusteringType, maxIterations>::Select(const arma::mat&, size_t)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp:42:38: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
42 | arma::mat* centroids = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp:42:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp:42:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp: In instantiation of ‘static const arma::mat* mlpack::KMeansSelection<ClusteringType, maxIterations>::Select(const arma::mat&, size_t) [with ClusteringType = mlpack::KMeans<>; unsigned int maxIterations = 5; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/nystroem_method_impl.hpp:83:47: required from ‘void mlpack::NystroemMethod<KernelType, PointSelectionPolicy>::Apply(arma::mat&) [with KernelType = mlpack::LinearKernel; PointSelectionPolicy = mlpack::KMeansSelection<>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kernel_pca/kernel_rules/nystroem_method.hpp:48:13: required from ‘static void mlpack::NystroemKernelRule<KernelType, PointSelectionPolicy>::ApplyKernelMatrix(const arma::mat&, arma::mat&, arma::vec&, arma::mat&, size_t, KernelType) [with KernelType = mlpack::LinearKernel; PointSelectionPolicy = mlpack::KMeansSelection<>; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kernel_pca/kernel_pca_impl.hpp:37:32: required from ‘void mlpack::KernelPCA<KernelType, KernelRule>::Apply(const arma::mat&, arma::mat&, arma::vec&, arma::mat&, size_t) [with KernelType = mlpack::LinearKernel; KernelRule = mlpack::NystroemKernelRule<mlpack::LinearKernel, mlpack::KMeansSelection<> >; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kernel_pca/kernel_pca_impl.hpp:77:8: required from ‘void mlpack::KernelPCA<KernelType, KernelRule>::Apply(arma::mat&, size_t) [with KernelType = mlpack::LinearKernel; KernelRule = mlpack::NystroemKernelRule<mlpack::LinearKernel, mlpack::KMeansSelection<> >; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kernel_pca/kernel_pca_main.cpp:145:17: required from ‘void RunKPCA(arma::mat&, bool, bool, size_t, const std::string&, KernelType&) [with KernelType = mlpack::LinearKernel; arma::mat = arma::Mat<double>; size_t = unsigned int; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kernel_pca/kernel_pca_main.cpp:208:26: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp:42:28: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
42 | arma::mat* centroids = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp:42:28: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/nystroem_method/kmeans_selection.hpp:42:28: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 11%] Linking CXX executable ../../../bin/mlpack_kernel_pca
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_kernel_pca.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_kernel_pca.dir/kernel_pca/kernel_pca_main.cpp.o -o ../../../bin/mlpack_kernel_pca /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 11%] Built target mlpack_kernel_pca
make -f src/mlpack/methods/CMakeFiles/mlpack_kmeans.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_kmeans.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_kmeans.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_kmeans.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_kmeans.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 11%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_kmeans.dir/kmeans/kmeans_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_kmeans.dir/kmeans/kmeans_main.cpp.o -MF CMakeFiles/mlpack_kmeans.dir/kmeans/kmeans_main.cpp.o.d -o CMakeFiles/mlpack_kmeans.dir/kmeans/kmeans_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:19,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:29,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans.hpp:173:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In member function ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/pelleg_moore_kmeans.hpp:90,
from /<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans.hpp:32:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/pelleg_moore_kmeans_impl.hpp: In instantiation of ‘mlpack::PellegMooreKMeans<MetricType, MatType>::PellegMooreKMeans(const MatType&, MetricType&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:203:38: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::PellegMooreKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::PellegMooreKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:281:27: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/pelleg_moore_kmeans_impl.hpp:26:10: warning: ‘new’ of type ‘mlpack::PellegMooreKMeans<mlpack::LMetric<2, true>, arma::Mat<double> >::TreeType’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::PellegMooreKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
26 | tree(new TreeType(const_cast<MatType&>(datasetOrig))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/pelleg_moore_kmeans_impl.hpp:26:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/pelleg_moore_kmeans_impl.hpp:26:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In instantiation of ‘mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::DualTreeKMeans(const MatType&, MetricType&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:203:38: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: warning: ‘new’ of type ‘mlpack::DualTreeKMeans<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::KDTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
58 | tree(new Tree(const_cast<MatType&>(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In instantiation of ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:9: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In instantiation of ‘mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::DualTreeKMeans(const MatType&, MetricType&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:203:38: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:291:33: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: warning: ‘new’ of type ‘mlpack::DualTreeKMeans<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>::Tree’ {aka ‘mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>’} with extended alignment 16 [-Waligned-new=]
58 | tree(new Tree(const_cast<MatType&>(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In instantiation of ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:291:33: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:9: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
118 | new arma::mat(1, centroids.n_elem) : &interclusterDistances;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:118:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::PellegMooreKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/pelleg_moore_kmeans_impl.hpp:26:10: required from ‘mlpack::PellegMooreKMeans<MetricType, MatType>::PellegMooreKMeans(const MatType&, MetricType&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:203:38: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::PellegMooreKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::PellegMooreKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:281:27: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: required from ‘mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::DualTreeKMeans(const MatType&, MetricType&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:203:38: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In instantiation of ‘TreeType* mlpack::BuildForcedLeafSizeTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, DualTreeKMeansStatistic, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:104:53: required from ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:35:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
35 | return new TreeType(std::forward<MatType>(dataset), oldFromNew, 1);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:35:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:35:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(Tree, mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::DualTreeKMeans<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::KDTree>::NNSTreeType; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:111:7: required from ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:66:19: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::DualTreeKMeans<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::KDTree>::NNSTreeType, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
66 | referenceTree(new Tree(std::move(referenceTree))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:66:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:66:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::DualTreeKMeans<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::KDTree>::NNSTreeType; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:121:15: required from ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp: In instantiation of ‘TreeType* mlpack::BuildForcedLeafSizeTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = CoverTree<LMetric<2, true>, DualTreeKMeansStatistic, arma::Mat<double>, FirstPointIsRoot>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:104:53: required from ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:291:33: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:46:10: warning: ‘new’ of type ‘mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>’ with extended alignment 16 [-Waligned-new=]
46 | return new TreeType(std::forward<MatType>(dataset));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:46:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:46:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(Tree, mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::DualTreeKMeans<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>::NNSTreeType; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; Tree = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:111:7: required from ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:291:33: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:66:19: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::DualTreeKMeans<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>::NNSTreeType, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>’} with extended alignment 16 [-Waligned-new=]
66 | referenceTree(new Tree(std::move(referenceTree))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:66:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:66:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::DualTreeKMeans<mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::StandardCoverTree>::NNSTreeType; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:121:15: required from ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:291:33: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::PellegMooreKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:45:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::PellegMooreKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/pelleg_moore_kmeans_impl.hpp:26:10: required from ‘mlpack::PellegMooreKMeans<MetricType, MatType>::PellegMooreKMeans(const MatType&, MetricType&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:203:38: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::PellegMooreKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::PellegMooreKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:281:27: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::PellegMooreKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::PellegMooreKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:45:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: required from ‘mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::DualTreeKMeans(const MatType&, MetricType&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:203:38: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:35:10: required from ‘TreeType* mlpack::BuildForcedLeafSizeTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, DualTreeKMeansStatistic, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:104:53: required from ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree.hpp:580,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CreateChildren(arma::Col<unsigned int>&, arma::vec&, size_t, size_t&, size_t&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; arma::vec = arma::Col<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:87:3: required from ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const MatType&, ElemType, MetricType*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:58:10: required from ‘mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::DualTreeKMeans(const MatType&, MetricType&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:203:38: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::CoverTreeDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:291:33: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1157:24: warning: ‘new’ of type ‘mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>’ with extended alignment 16 [-Waligned-new=]
1157 | children.push_back(new CoverTree(*dataset, base, point, INT_MIN, this, 0,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1158 | indices, distances, 0, tempSize, usedSetSize, *metric));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1157:24: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1157:24: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1165:26: warning: ‘new’ of type ‘mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>’ with extended alignment 16 [-Waligned-new=]
1165 | children.push_back(new CoverTree(*dataset, base, indices[i],
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1166 | INT_MIN, this, distances[i], indices, distances, 0, tempSize,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1167 | usedSetSize, *metric));
| ~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1165:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1165:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1197:22: warning: ‘new’ of type ‘mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>’ with extended alignment 16 [-Waligned-new=]
1197 | children.push_back(new CoverTree(*dataset, base, point, nextScale, this, 0,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1198 | indices, distances, childNearSetSize, childFarSetSize, childUsedSetSize,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1199 | *metric));
| ~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1197:22: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1197:22: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1255:26: warning: ‘new’ of type ‘mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>’ with extended alignment 16 [-Waligned-new=]
1255 | children.push_back(new CoverTree(*dataset, base, indices[0], nextScale,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1256 | this, distances[0], indices, distances, childNearSetSize, farSetSize,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1257 | usedSetSize, *metric));
| ~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1255:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1255:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1297:24: warning: ‘new’ of type ‘mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>’ with extended alignment 16 [-Waligned-new=]
1297 | children.push_back(new CoverTree(*dataset, base, indices[0], nextScale,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1298 | this, distances[0], childIndices, childDistances, childNearSetSize,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1299 | childFarSetSize, childUsedSetSize, *metric));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1297:24: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:1297:24: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:78:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:35:10: required from ‘TreeType* mlpack::BuildForcedLeafSizeTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, DualTreeKMeansStatistic, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/dual_tree_kmeans_impl.hpp:104:53: required from ‘double mlpack::DualTreeKMeans<MetricType, MatType, TreeType>::Iterate(const arma::mat&, arma::mat&, arma::Col<unsigned int>&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_impl.hpp:212:32: required from ‘void mlpack::KMeans<MetricType, InitialPartitionPolicy, EmptyClusterPolicy, LloydStepType, MatType>::Cluster(const MatType&, size_t, arma::mat&, bool) [with MetricType = mlpack::LMetric<2, true>; InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans; MatType = arma::Mat<double>; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:407:19: required from ‘void RunKMeans(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters; LloydStepType = mlpack::DefaultDualTreeKMeans]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:286:31: required from ‘void FindLloydStepType(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart; EmptyClusterPolicy = mlpack::AllowEmptyClusters]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:241:66: required from ‘void FindEmptyClusterPolicy(mlpack::util::Params&, mlpack::util::Timers&, const InitialPartitionPolicy&) [with InitialPartitionPolicy = mlpack::RefinedStart]’
/<<PKGBUILDDIR>>/src/mlpack/methods/kmeans/kmeans_main.cpp:210:41: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >; _Distance = int; _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >]’:
/usr/include/c++/13/bits/stl_heap.h:135:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
135 | __push_heap(_RandomAccessIterator __first,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:73:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >&}; _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, std::priority_queue<mlpack::QueueFrame<mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>, typename RuleType::TraversalInfoType> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:155:26:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, std::priority_queue<mlpack::QueueFrame<mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>, typename RuleType::TraversalInfoType> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:159:27:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, std::priority_queue<mlpack::QueueFrame<mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>, typename RuleType::TraversalInfoType> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:182:26:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, std::priority_queue<mlpack::QueueFrame<mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>, typename RuleType::TraversalInfoType> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:168:26:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, std::priority_queue<mlpack::QueueFrame<mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>, typename RuleType::TraversalInfoType> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:172:26:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, std::priority_queue<mlpack::QueueFrame<mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>, typename RuleType::TraversalInfoType> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:186:26:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, std::priority_queue<mlpack::QueueFrame<mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>, typename RuleType::TraversalInfoType> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:190:27:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, std::priority_queue<mlpack::QueueFrame<mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>, typename RuleType::TraversalInfoType> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:194:27:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Alloc = std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >; _Sequence = std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > >; _Compare = std::less<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > >]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BreadthFirstDualTreeTraverser<RuleType>::Traverse(mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&, mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/breadth_first_dual_tree_traverser_impl.hpp:84:13:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >*, std::vector<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > >, std::allocator<mlpack::QueueFrame<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>, mlpack::TraversalInfo<mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> > > > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::DualTreeKMeansRules<mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:505:16,
inlined from ‘double mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:99:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::DualTreeKMeansStatistic; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:505:16,
inlined from ‘double mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::DualTreeKMeansStatistic, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:99:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 11%] Linking CXX executable ../../../bin/mlpack_kmeans
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_kmeans.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_kmeans.dir/kmeans/kmeans_main.cpp.o -o ../../../bin/mlpack_kmeans /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 11%] Built target mlpack_kmeans
make -f src/mlpack/methods/CMakeFiles/mlpack_lars.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_lars.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_lars.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_lars.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_lars.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 12%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_lars.dir/lars/lars_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_lars.dir/lars/lars_main.cpp.o -MF CMakeFiles/mlpack_lars.dir/lars/lars_main.cpp.o.d -o CMakeFiles/mlpack_lars.dir/lars/lars_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_main.cpp: In function ‘void lars(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_main.cpp:156:50: warning: ‘new’ of type ‘mlpack::LARS’ with extended alignment 16 [-Waligned-new=]
156 | lars = new LARS(useCholesky, lambda1, lambda2);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_main.cpp:156:50: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_main.cpp:156:50: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::LARS; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::LARS*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::LARS*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_main.cpp:110:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::LARS’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator<double>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/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<double>]’:
/usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
529 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const arma::Col<double>&}; _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<arma::Col<double> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:316:21:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Col<double>*, std::vector<arma::Col<double> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:317:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:599:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Col<double>*, std::vector<arma::Col<double> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:620:25:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:655:25:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 12%] Linking CXX executable ../../../bin/mlpack_lars
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_lars.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_lars.dir/lars/lars_main.cpp.o -o ../../../bin/mlpack_lars /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 12%] Built target mlpack_lars
make -f src/mlpack/methods/CMakeFiles/mlpack_linear_svm.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_linear_svm.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_linear_svm.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_linear_svm.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_linear_svm.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 13%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_linear_svm.dir/linear_svm/linear_svm_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_linear_svm.dir/linear_svm/linear_svm_main.cpp.o -MF CMakeFiles/mlpack_linear_svm.dir/linear_svm/linear_svm_main.cpp.o.d -o CMakeFiles/mlpack_linear_svm.dir/linear_svm/linear_svm_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/linear_svm/linear_svm_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/linear_svm/linear_svm_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/linear_svm/linear_svm_main.cpp: In function ‘void linear_svm(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/linear_svm/linear_svm_main.cpp:310:32: warning: ‘new’ of type ‘LinearSVMModel’ with extended alignment 16 [-Waligned-new=]
310 | model = new LinearSVMModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/linear_svm/linear_svm_main.cpp:310:32: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/linear_svm/linear_svm_main.cpp:310:32: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/linear_svm/linear_svm_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = LinearSVMModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = LinearSVMModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = LinearSVMModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/linear_svm/linear_svm_main.cpp:157:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘LinearSVMModel’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 13%] Linking CXX executable ../../../bin/mlpack_linear_svm
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_linear_svm.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_linear_svm.dir/linear_svm/linear_svm_main.cpp.o -o ../../../bin/mlpack_linear_svm /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 13%] Built target mlpack_linear_svm
make -f src/mlpack/methods/CMakeFiles/mlpack_lmnn.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_lmnn.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_lmnn.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_lmnn.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_lmnn.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 13%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_lmnn.dir/lmnn/lmnn_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_lmnn.dir/lmnn/lmnn_main.cpp.o -MF CMakeFiles/mlpack_lmnn.dir/lmnn/lmnn_main.cpp.o.d -o CMakeFiles/mlpack_lmnn.dir/lmnn/lmnn_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:197:7: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
93 | referenceSet(mode == NAIVE_MODE ? new MatType() : NULL), // Empty matrix.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:199:12: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:200:13: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:200:13: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:197:7: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/constraints_impl.hpp:184:15: required from ‘void mlpack::Constraints<MetricType>::Impostors(arma::Mat<unsigned int>&, const arma::mat&, const arma::Row<unsigned int>&, const arma::vec&) [with MetricType = mlpack::LMetric<2, true>; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_function_impl.hpp:87:23: required from ‘mlpack::LMNNFunction<MetricType>::LMNNFunction(const arma::mat&, const arma::Row<unsigned int>&, size_t, double, size_t, MetricType) [with MetricType = mlpack::LMetric<2, true>; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_impl.hpp:43:28: required from ‘void mlpack::LMNN<MetricType, OptimizerType>::LearnDistance(arma::mat&, CallbackTypes&& ...) [with CallbackTypes = {}; MetricType = mlpack::LMetric<2, true>; OptimizerType = ens::AdamType<ens::AMSGradUpdate>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:374:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/constraints_impl.hpp:184:15: required from ‘void mlpack::Constraints<MetricType>::Impostors(arma::Mat<unsigned int>&, const arma::mat&, const arma::Row<unsigned int>&, const arma::vec&) [with MetricType = mlpack::LMetric<2, true>; arma::mat = arma::Mat<double>; arma::vec = arma::Col<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_function_impl.hpp:87:23: required from ‘mlpack::LMNNFunction<MetricType>::LMNNFunction(const arma::mat&, const arma::Row<unsigned int>&, size_t, double, size_t, MetricType) [with MetricType = mlpack::LMetric<2, true>; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_impl.hpp:43:28: required from ‘void mlpack::LMNN<MetricType, OptimizerType>::LearnDistance(arma::mat&, CallbackTypes&& ...) [with CallbackTypes = {}; MetricType = mlpack::LMetric<2, true>; OptimizerType = ens::AdamType<ens::AMSGradUpdate>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_main.cpp:374:23: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:505:16,
inlined from ‘double mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:99:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const arma::Mat<double>&}; _Tp = arma::Mat<double>; _Alloc = std::allocator<arma::Mat<double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<arma::Mat<double> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = arma::Mat<double>; _Alloc = std::allocator<arma::Mat<double> >]’,
inlined from ‘void mlpack::LMNNFunction<MetricType>::UpdateCache(const arma::mat&, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_function_impl.hpp:148:40:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Mat<double>*, std::vector<arma::Mat<double> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview_elem1<double, Mat<unsigned int> >; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview_elem1<double, Mat<unsigned int> >; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview_elem1<double, Mat<unsigned int> >; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview_elem1<double, Mat<unsigned int> >; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = arma::Mat<double>; _Alloc = std::allocator<arma::Mat<double> >]’,
inlined from ‘mlpack::LMNNFunction<MetricType>::LMNNFunction(const arma::mat&, const arma::Row<unsigned int>&, size_t, double, size_t, MetricType) [with MetricType = mlpack::LMetric<2, true>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lmnn/lmnn_function_impl.hpp:63:38:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Mat<double>*, std::vector<arma::Mat<double> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 14%] Linking CXX executable ../../../bin/mlpack_lmnn
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_lmnn.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_lmnn.dir/lmnn/lmnn_main.cpp.o -o ../../../bin/mlpack_lmnn /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 14%] Built target mlpack_lmnn
make -f src/mlpack/methods/CMakeFiles/mlpack_local_coordinate_coding.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_local_coordinate_coding.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_local_coordinate_coding.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_local_coordinate_coding.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_local_coordinate_coding.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 14%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_local_coordinate_coding.dir/local_coordinate_coding/local_coordinate_coding_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_local_coordinate_coding.dir/local_coordinate_coding/local_coordinate_coding_main.cpp.o -MF CMakeFiles/mlpack_local_coordinate_coding.dir/local_coordinate_coding/local_coordinate_coding_main.cpp.o.d -o CMakeFiles/mlpack_local_coordinate_coding.dir/local_coordinate_coding/local_coordinate_coding_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/local_coordinate_coding/local_coordinate_coding_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/local_coordinate_coding/local_coordinate_coding_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/local_coordinate_coding/local_coordinate_coding_main.cpp: In function ‘void local_coordinate_coding(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/local_coordinate_coding/local_coordinate_coding_main.cpp:174:43: warning: ‘new’ of type ‘mlpack::LocalCoordinateCoding’ with extended alignment 16 [-Waligned-new=]
174 | lcc = new LocalCoordinateCoding(0, 0.0);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/local_coordinate_coding/local_coordinate_coding_main.cpp:174:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/local_coordinate_coding/local_coordinate_coding_main.cpp:174:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/local_coordinate_coding/local_coordinate_coding_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::LocalCoordinateCoding; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::LocalCoordinateCoding*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::LocalCoordinateCoding*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/local_coordinate_coding/local_coordinate_coding_main.cpp:109:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::LocalCoordinateCoding’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator<double>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/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<double>]’:
/usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
529 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const arma::Col<double>&}; _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<arma::Col<double> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:316:21:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Col<double>*, std::vector<arma::Col<double> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:317:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = arma::Col<double>; _Alloc = std::allocator<arma::Col<double> >]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:599:23:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::Col<double>*, std::vector<arma::Col<double> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:620:25:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::LARS::Train(const arma::mat&, const arma::rowvec&, arma::vec&, bool)’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lars/lars_impl.hpp:655:25:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 14%] Linking CXX executable ../../../bin/mlpack_local_coordinate_coding
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_local_coordinate_coding.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_local_coordinate_coding.dir/local_coordinate_coding/local_coordinate_coding_main.cpp.o -o ../../../bin/mlpack_local_coordinate_coding /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 14%] Built target mlpack_local_coordinate_coding
make -f src/mlpack/methods/CMakeFiles/mlpack_logistic_regression.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_logistic_regression.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_logistic_regression.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_logistic_regression.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_logistic_regression.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 14%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_logistic_regression.dir/logistic_regression/logistic_regression_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_logistic_regression.dir/logistic_regression/logistic_regression_main.cpp.o -MF CMakeFiles/mlpack_logistic_regression.dir/logistic_regression/logistic_regression_main.cpp.o.d -o CMakeFiles/mlpack_logistic_regression.dir/logistic_regression/logistic_regression_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/logistic_regression/logistic_regression_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/logistic_regression/logistic_regression_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/logistic_regression/logistic_regression_main.cpp: In function ‘void logistic_regression(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/logistic_regression/logistic_regression_main.cpp:244:42: warning: ‘new’ of type ‘mlpack::LogisticRegression<>’ with extended alignment 16 [-Waligned-new=]
244 | model = new LogisticRegression<>(0, 0);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/logistic_regression/logistic_regression_main.cpp:244:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/logistic_regression/logistic_regression_main.cpp:244:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/logistic_regression/logistic_regression_main.cpp:17:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::LogisticRegression<>; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::LogisticRegression<>*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::LogisticRegression<>*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/logistic_regression/logistic_regression_main.cpp:141:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::LogisticRegression<>’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 15%] Linking CXX executable ../../../bin/mlpack_logistic_regression
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_logistic_regression.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_logistic_regression.dir/logistic_regression/logistic_regression_main.cpp.o -o ../../../bin/mlpack_logistic_regression /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 15%] Built target mlpack_logistic_regression
make -f src/mlpack/methods/CMakeFiles/mlpack_lsh.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_lsh.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_lsh.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_lsh.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_lsh.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 15%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_lsh.dir/lsh/lsh_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_lsh.dir/lsh/lsh_main.cpp.o -MF CMakeFiles/mlpack_lsh.dir/lsh/lsh_main.cpp.o.d -o CMakeFiles/mlpack_lsh.dir/lsh/lsh_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_main.cpp:13:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_main.cpp: In function ‘void lsh(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_main.cpp:185:31: warning: ‘new’ of type ‘mlpack::LSHSearch<>’ with extended alignment 16 [-Waligned-new=]
185 | allkann = new LSHSearch<>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_main.cpp:185:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_main.cpp:185:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::LSHSearch<>; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::LSHSearch<>*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::LSHSearch<>*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_main.cpp:83:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::LSHSearch<>’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<pair<double, unsigned int> > >]’:
/usr/include/c++/13/bits/stl_heap.h:135:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
135 | __push_heap(_RandomAccessIterator __first,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::LSHSearch<>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::LSHSearch<>::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::LSHSearch<>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::LSHSearch<>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::LSHSearch<SortPolicy, MatType>::BaseCase(size_t, const arma::uvec&, size_t, arma::Mat<unsigned int>&, arma::mat&) const [with SortPolicy = mlpack::NearestNS; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_search_impl.hpp:368:17:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::LSHSearch<>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::LSHSearch<SortPolicy, MatType>::BaseCase(size_t, const arma::uvec&, size_t, arma::Mat<unsigned int>&, arma::mat&) const [with SortPolicy = mlpack::NearestNS; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_search_impl.hpp:386:18:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::LSHSearch<>::CandidateCmp]’,
inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::LSHSearch<>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:567:23,
inlined from ‘void mlpack::LSHSearch<SortPolicy, MatType>::BaseCase(size_t, const arma::uvec&, size_t, const MatType&, arma::Mat<unsigned int>&, arma::mat&) const [with SortPolicy = mlpack::NearestNS; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_search_impl.hpp:415:17:
/usr/include/c++/13/bits/stl_heap.h:413:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
413 | std::__make_heap(__first, __last, __cmp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::LSHSearch<>::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::LSHSearch<SortPolicy, MatType>::BaseCase(size_t, const arma::uvec&, size_t, const MatType&, arma::Mat<unsigned int>&, arma::mat&) const [with SortPolicy = mlpack::NearestNS; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_search_impl.hpp:429:18:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = std::greater<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void mlpack::LSHSearch<SortPolicy, MatType>::GetAdditionalProbingBins(const arma::vec&, const arma::vec&, size_t, arma::mat&) const [with SortPolicy = mlpack::NearestNS; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_search_impl.hpp:656:15:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = std::greater<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void mlpack::LSHSearch<SortPolicy, MatType>::GetAdditionalProbingBins(const arma::vec&, const arma::vec&, size_t, arma::mat&) const [with SortPolicy = mlpack::NearestNS; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_search_impl.hpp:677:21:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = std::greater<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void mlpack::LSHSearch<SortPolicy, MatType>::GetAdditionalProbingBins(const arma::vec&, const arma::vec&, size_t, arma::mat&) const [with SortPolicy = mlpack::NearestNS; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/lsh/lsh_search_impl.hpp:689:21:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 15%] Linking CXX executable ../../../bin/mlpack_lsh
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_lsh.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_lsh.dir/lsh/lsh_main.cpp.o -o ../../../bin/mlpack_lsh /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 15%] Built target mlpack_lsh
make -f src/mlpack/methods/CMakeFiles/mlpack_mean_shift.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_mean_shift.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_mean_shift.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_mean_shift.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_mean_shift.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 16%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_mean_shift.dir/mean_shift/mean_shift_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_mean_shift.dir/mean_shift/mean_shift_main.cpp.o -MF CMakeFiles/mlpack_mean_shift.dir/mean_shift/mean_shift_main.cpp.o.d -o CMakeFiles/mlpack_mean_shift.dir/mean_shift/mean_shift_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift.hpp:171,
from /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search.hpp:327,
from /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp: In instantiation of ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(MatType, bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:209:17: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:35:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
35 | referenceSet(naive ? new MatType(std::move(referenceSet)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:35:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:35:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(MatType, mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:288:9: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
39 | referenceSet(mode == NAIVE_MODE ? new MatType(std::move(referenceSetIn)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:39:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:291:28: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:64:24: required from ‘double mlpack::MeanShift<UseKernel, KernelType, MatType>::EstimateRadius(const MatType&, double) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:193:12: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:64:24: required from ‘double mlpack::MeanShift<UseKernel, KernelType, MatType>::EstimateRadius(const MatType&, double) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:193:12: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:33:49: required from ‘mlpack::RangeSearch<MetricType, MatType, TreeType>::RangeSearch(MatType, bool, bool, MetricType) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:209:17: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RangeSearchStat; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RangeSearchStat, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_impl.hpp:369:38: required from ‘void mlpack::RangeSearch<MetricType, MatType, TreeType>::Search(const MatType&, const mlpack::Range&, std::vector<std::vector<unsigned int> >&, std::vector<std::vector<double> >&) [with MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; mlpack::Range = mlpack::RangeType<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:225:27: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:38:24: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(MatType, mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:288:9: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:291:28: required from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_main.cpp:118:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator<double>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘double mlpack::RangeSearchRules<MetricType, TreeType>::BaseCase(size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:71:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void mlpack::RangeSearchRules<MetricType, TreeType>::AddResult(size_t, TreeType&) [with MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RangeSearchStat, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/range_search/range_search_rules_impl.hpp:257:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const arma::Col<double>&>, std::tuple<>}; _Key = arma::Col<double>; _Val = std::pair<const arma::Col<double>, int>; _KeyOfValue = std::_Select1st<std::pair<const arma::Col<double>, int> >; _Compare = mlpack::less<arma::Col<double> >; _Alloc = std::allocator<std::pair<const arma::Col<double>, int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<arma::Col<double>, std::pair<const arma::Col<double>, int>, std::_Select1st<std::pair<const arma::Col<double>, int> >, mlpack::less<arma::Col<double> >, std::allocator<std::pair<const arma::Col<double>, int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:505:16,
inlined from ‘double mlpack::NeighborSearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_rules_impl.hpp:99:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = arma::Col<double>; _Tp = int; _Compare = mlpack::less<arma::Col<double> >; _Alloc = std::allocator<std::pair<const arma::Col<double>, int> >]’,
inlined from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::GenSeeds(const MatType&, double, int, MatType&) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:104:29,
inlined from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:200:13:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<arma::Col<double>, std::pair<const arma::Col<double>, int>, std::_Select1st<std::pair<const arma::Col<double>, int> >, mlpack::less<arma::Col<double> >, std::allocator<std::pair<const arma::Col<double>, int> > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = arma::Col<double>; _Tp = int; _Compare = mlpack::less<arma::Col<double> >; _Alloc = std::allocator<std::pair<const arma::Col<double>, int> >]’,
inlined from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::GenSeeds(const MatType&, double, int, MatType&) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:106:28,
inlined from ‘void mlpack::MeanShift<UseKernel, KernelType, MatType>::Cluster(const MatType&, arma::Row<unsigned int>&, arma::mat&, bool, bool) [with bool UseKernel = false; KernelType = mlpack::GaussianKernel; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/mean_shift/mean_shift_impl.hpp:200:13:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<arma::Col<double>, std::pair<const arma::Col<double>, int>, std::_Select1st<std::pair<const arma::Col<double>, int> >, mlpack::less<arma::Col<double> >, std::allocator<std::pair<const arma::Col<double>, int> > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 16%] Linking CXX executable ../../../bin/mlpack_mean_shift
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_mean_shift.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_mean_shift.dir/mean_shift/mean_shift_main.cpp.o -o ../../../bin/mlpack_mean_shift /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 16%] Built target mlpack_mean_shift
make -f src/mlpack/methods/CMakeFiles/mlpack_nbc.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_nbc.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_nbc.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_nbc.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_nbc.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 16%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_nbc.dir/naive_bayes/nbc_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_nbc.dir/naive_bayes/nbc_main.cpp.o -MF CMakeFiles/mlpack_nbc.dir/naive_bayes/nbc_main.cpp.o.d -o CMakeFiles/mlpack_nbc.dir/naive_bayes/nbc_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/naive_bayes/nbc_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/naive_bayes/nbc_main.cpp:15:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/naive_bayes/nbc_main.cpp: In function ‘void nbc(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/naive_bayes/nbc_main.cpp:157:26: warning: ‘new’ of type ‘NBCModel’ with extended alignment 16 [-Waligned-new=]
157 | model = new NBCModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/naive_bayes/nbc_main.cpp:157:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/naive_bayes/nbc_main.cpp:157:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/naive_bayes/nbc_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = NBCModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = NBCModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = NBCModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/naive_bayes/nbc_main.cpp:115:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘NBCModel’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 16%] Linking CXX executable ../../../bin/mlpack_nbc
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_nbc.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_nbc.dir/naive_bayes/nbc_main.cpp.o -o ../../../bin/mlpack_nbc /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 16%] Built target mlpack_nbc
make -f src/mlpack/methods/CMakeFiles/mlpack_nca.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_nca.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_nca.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_nca.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_nca.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 17%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_nca.dir/nca/nca_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_nca.dir/nca/nca_main.cpp.o -MF CMakeFiles/mlpack_nca.dir/nca/nca_main.cpp.o.d -o CMakeFiles/mlpack_nca.dir/nca/nca_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/nca/nca_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/nca/nca_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 17%] Linking CXX executable ../../../bin/mlpack_nca
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_nca.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_nca.dir/nca/nca_main.cpp.o -o ../../../bin/mlpack_nca /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 17%] Built target mlpack_nca
make -f src/mlpack/methods/CMakeFiles/mlpack_knn.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_knn.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_knn.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_knn.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_knn.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 17%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_knn.dir/neighbor_search/knn_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_knn.dir/neighbor_search/knn_main.cpp.o -MF CMakeFiles/mlpack_knn.dir/neighbor_search/knn_main.cpp.o.d -o CMakeFiles/mlpack_knn.dir/neighbor_search/knn_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:13:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp: In function ‘void knn(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:214:24: warning: ‘new’ of type ‘KNNModel’ {aka ‘mlpack::NSModel<mlpack::NearestNS>’} with extended alignment 16 [-Waligned-new=]
214 | knn = new KNNModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:214:24: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:214:24: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::NSModel<mlpack::NearestNS>; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::NSModel<mlpack::NearestNS>*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::NSModel<mlpack::NearestNS>*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:87:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::NSModel<mlpack::NearestNS>’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:515:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
93 | referenceSet(mode == NAIVE_MODE ? new MatType() : NULL), // Empty matrix.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:519:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:522:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:529:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:535:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:538:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:512:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:525:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:541:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:544:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:547:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:284:30: required from ‘mlpack::SpillNSWrapper<SortPolicy>::SpillNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:551:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:554:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:557:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree.hpp:580,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, ElemType) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = CoverTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, FirstPointIsRoot>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:515:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
239 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp:638,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:20,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:22:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:519:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, RStarTreeSplit, RStarTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:522:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:26:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:525:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, XTreeSplit, RTreeDescentHeuristic, XTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:529:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:535:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:538:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:541:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:554:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:512:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:525:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:541:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, RPTreeMeanSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:544:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, RPTreeMaxSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:547:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In instantiation of ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(MatType&&, double, size_t, double) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; HyperplaneType = mlpack::AxisOrthogonalHyperplane; SplitType = mlpack::MidpointSpaceSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = SpillTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, AxisOrthogonalHyperplane, MidpointSpaceSplit>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:284:30: required from ‘mlpack::SpillNSWrapper<SortPolicy>::SpillNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:551:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:79:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
79 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:79:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:79:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:554:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree.hpp:468,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:21:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = Octree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double> >; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:557:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
192 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:525:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp:296,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:35:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:30:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:111:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
46 | new arma::Col<HilbertElemType>(tree->Dataset().n_rows)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
61 | localHilbertValues = new arma::Mat<HilbertElemType>(tree->Dataset().n_rows,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
62 | tree->MaxLeafSize() + 1);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:541:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In instantiation of ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; HyperplaneType = mlpack::AxisOrthogonalHyperplane; SplitType = mlpack::MidpointSpaceSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:89:3: required from ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(MatType&&, double, size_t, double) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; HyperplaneType = mlpack::AxisOrthogonalHyperplane; SplitType = mlpack::MidpointSpaceSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = SpillTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, AxisOrthogonalHyperplane, MidpointSpaceSplit>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:284:30: required from ‘mlpack::SpillNSWrapper<SortPolicy>::SpillNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:551:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:19: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:19: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:19: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:554:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp:38:22: required from ‘static void mlpack::RTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:519:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split_impl.hpp:34:22: required from ‘static void mlpack::HilbertRTreeSplit<splitOrder>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; unsigned int splitOrder = 2]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp:60:22: required from ‘static void mlpack::RPlusTreeSplit<SplitPolicyType, SweepType>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicyType = mlpack::RPlusTreeSplitPolicy; SweepType = mlpack::MinimalCoverageSweep]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:535:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp:60:22: required from ‘static void mlpack::RPlusTreeSplit<SplitPolicyType, SweepType>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicyType = mlpack::RPlusPlusTreeSplitPolicy; SweepType = mlpack::MinimalSplitsNumberSweep]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:538:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const mlpack::DiscreteHilbertValue<TreeElemType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:40:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:191:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split_impl.hpp:34:22: required from ‘static void mlpack::HilbertRTreeSplit<splitOrder>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; unsigned int splitOrder = 2]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:258:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
83 | localHilbertValues = new arma::Mat<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
84 | *other.LocalHilbertValues());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
90 | valueToInsert = new arma::Col<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
91 | *other.ValueToInsert());
| ~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree() [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>]’:
/usr/include/cereal/access.hpp:317:16: required from ‘static T* cereal::access::construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >]’
/usr/include/cereal/details/traits.hpp:1364:46: required from ‘static T* cereal::detail::Construct<T, A, false, false, false, false>::load_andor_construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >; A = cereal::BinaryInputArchive]’
/usr/include/cereal/types/memory.hpp:411:101: required from ‘typename std::enable_if<(! cereal::traits::has_load_and_construct<T, Archive>::value), void>::type cereal::load(Archive&, memory_detail::PtrWrapper<std::unique_ptr<T, D>&>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > >; typename std::enable_if<(! traits::has_load_and_construct<T, Archive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/types/memory.hpp:253:7: required from ‘typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type cereal::load(Archive&, std::unique_ptr<T, D>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > >; typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/cereal/pointer_wrapper.hpp:65:7: required from ‘void cereal::PointerWrapper<T>::load(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:287:43: required from ‘static decltype (t.load(ar, version)) cereal::access::member_load(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > >; decltype (t.load(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1058:28: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > >; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > >}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:935:7: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:245:7: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::LeafSizeNSWrapper<mlpack::NearestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::LeafSizeNSWrapper<mlpack::NearestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::LeafSizeNSWrapper<mlpack::NearestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::LeafSizeNSWrapper<mlpack::NearestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::LeafSizeNSWrapper<mlpack::NearestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::LeafSizeNSWrapper<mlpack::NearestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::LeafSizeNSWrapper<mlpack::NearestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::LeafSizeNSWrapper<mlpack::NearestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:461:11: required from ‘void mlpack::NSModel<SortPolicy>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; SortPolicy = mlpack::NearestNS; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::NSModel<mlpack::NearestNS>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::NSModel<mlpack::NearestNS>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::NSModel<mlpack::NearestNS>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::NSModel<mlpack::NearestNS>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::NSModel<mlpack::NearestNS>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::NSModel<mlpack::NearestNS>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::NSModel<mlpack::NearestNS>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::NSModel<mlpack::NearestNS>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/data/load_model_impl.hpp:95:9: required from ‘bool mlpack::data::Load(const std::string&, const std::string&, T&, bool, format) [with T = mlpack::NSModel<mlpack::NearestNS>; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:124:15: required from ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::NSModel<mlpack::NearestNS>; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::NSModel<mlpack::NearestNS>*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::NSModel<mlpack::NearestNS>*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/knn_main.cpp:87:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
475 | dataset(new MatType()),
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(mlpack::Octree<MetricType, StatisticType, MatType>&&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:132:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
422 | other.dataset = new MatType();
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; Tree = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
154 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::UBTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’} with extended alignment 16 [-Waligned-new=]
125 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(Tree) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:132:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::UBTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’} with extended alignment 16 [-Waligned-new=]
347 | this->referenceTree = new Tree(std::move(referenceTree));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::SpillNSWrapper<SortPolicy>* mlpack::SpillNSWrapper<SortPolicy>::Clone() const [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:293:27: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; Tree = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:228:14: required from ‘void mlpack::SpillNSWrapper<SortPolicy>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:210:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:234:14: required from ‘void mlpack::SpillNSWrapper<SortPolicy>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:210:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::VPTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’} with extended alignment 16 [-Waligned-new=]
125 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(Tree) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:132:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::VPTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’} with extended alignment 16 [-Waligned-new=]
347 | this->referenceTree = new Tree(std::move(referenceTree));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
125 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(Tree) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:132:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
347 | this->referenceTree = new Tree(std::move(referenceTree));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; Tree = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const mlpack::Octree<MetricType, StatisticType, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
348 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:28:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
28 | dataset(new MatType(dataset)),
| ^~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:28:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:28:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In instantiation of ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; HyperplaneType = mlpack::AxisOrthogonalHyperplane; SplitType = mlpack::MidpointSpaceSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::SpillNSWrapper<SortPolicy>* mlpack::SpillNSWrapper<SortPolicy>::Clone() const [with SortPolicy = mlpack::NearestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:293:27: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:152:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
152 | new MatType(*other.dataset) : other.dataset),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:152:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:152:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:19: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
509 | new MatType(*other.dataset) : other.dataset),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = Octree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double> >; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
66 | dataset(new MatType(dataset)),
| ^~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, RPTreeMaxSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, RPTreeMeanSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::NearestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double> > >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<double*, vector<double> >; _Distance = int; _Tp = double; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:73:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/string:51,
from /usr/include/c++/13/stdexcept:39,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:34:
/usr/include/c++/13/bits/stl_algobase.h: In function ‘void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >]’:
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Distance = int; _Tp = pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1942 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:497:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:658:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Distance = int; _Tp = pair<arma::Col<long long unsigned int>, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1910:25,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/bits/stl_algo.h:1635:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1635 | std::__make_heap(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1911:23,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/bits/stl_heap.h:425:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
425 | std::__pop_heap(__first, __last, __last, __comp);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool mlpack::UBTreeSplit<BoundType, MatType>::SplitNode(BoundType&, MatType&, size_t, size_t, SplitInfo&) [with BoundType = mlpack::CellBound<mlpack::LMetric<2, true> >; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/ub_tree_split_impl.hpp:36:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool mlpack::UBTreeSplit<BoundType, MatType>::SplitNode(BoundType&, MatType&, size_t, size_t, SplitInfo&) [with BoundType = mlpack::CellBound<mlpack::LMetric<2, true> >; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/ub_tree_split_impl.hpp:36:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:66:
/usr/include/c++/13/bits/stl_vector.h: In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 18%] Linking CXX executable ../../../bin/mlpack_knn
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_knn.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_knn.dir/neighbor_search/knn_main.cpp.o -o ../../../bin/mlpack_knn /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 18%] Built target mlpack_knn
make -f src/mlpack/methods/CMakeFiles/mlpack_kfn.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_kfn.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_kfn.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_kfn.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_kfn.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 18%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_kfn.dir/neighbor_search/kfn_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_kfn.dir/neighbor_search/kfn_main.cpp.o -MF CMakeFiles/mlpack_kfn.dir/neighbor_search/kfn_main.cpp.o.d -o CMakeFiles/mlpack_kfn.dir/neighbor_search/kfn_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:13:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search.hpp:366,
from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In member function ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp: In function ‘void kfn(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:202:24: warning: ‘new’ of type ‘KFNModel’ {aka ‘mlpack::NSModel<mlpack::FurthestNS>’} with extended alignment 16 [-Waligned-new=]
202 | kfn = new KFNModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:202:24: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:202:24: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::NSModel<mlpack::FurthestNS>; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::NSModel<mlpack::FurthestNS>*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::NSModel<mlpack::FurthestNS>*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:83:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::NSModel<mlpack::FurthestNS>’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:515:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
93 | referenceSet(mode == NAIVE_MODE ? new MatType() : NULL), // Empty matrix.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:519:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:522:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:529:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:535:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:538:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:512:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:525:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:541:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:544:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:547:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:284:30: required from ‘mlpack::SpillNSWrapper<SortPolicy>::SpillNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:551:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:554:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:557:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:93:39: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree.hpp:580,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, ElemType) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = CoverTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, FirstPointIsRoot>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:515:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
239 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp:638,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:20,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:22:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:519:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, RStarTreeSplit, RStarTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:522:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:26:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:525:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, XTreeSplit, RTreeDescentHeuristic, XTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:529:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:535:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:538:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:541:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:554:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:512:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:525:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:541:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HRectBound, RPTreeMeanSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:544:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HRectBound, RPTreeMaxSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:547:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In instantiation of ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(MatType&&, double, size_t, double) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; HyperplaneType = mlpack::AxisOrthogonalHyperplane; SplitType = mlpack::MidpointSpaceSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = SpillTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, AxisOrthogonalHyperplane, MidpointSpaceSplit>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:284:30: required from ‘mlpack::SpillNSWrapper<SortPolicy>::SpillNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:551:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:79:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
79 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:79:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:79:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:554:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree.hpp:468,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:21:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = Octree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double> >; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:557:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
192 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:525:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp:296,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:35:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:30:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:111:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
46 | new arma::Col<HilbertElemType>(tree->Dataset().n_rows)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
61 | localHilbertValues = new arma::Mat<HilbertElemType>(tree->Dataset().n_rows,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
62 | tree->MaxLeafSize() + 1);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:541:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In instantiation of ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; HyperplaneType = mlpack::AxisOrthogonalHyperplane; SplitType = mlpack::MidpointSpaceSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:89:3: required from ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(MatType&&, double, size_t, double) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; HyperplaneType = mlpack::AxisOrthogonalHyperplane; SplitType = mlpack::MidpointSpaceSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = SpillTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, AxisOrthogonalHyperplane, MidpointSpaceSplit>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:284:30: required from ‘mlpack::SpillNSWrapper<SortPolicy>::SpillNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:551:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:19: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:19: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:19: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:175:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:209:61: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::LeafSizeNSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:554:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp:38:22: required from ‘static void mlpack::RTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:519:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split_impl.hpp:34:22: required from ‘static void mlpack::HilbertRTreeSplit<splitOrder>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; unsigned int splitOrder = 2]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp:60:22: required from ‘static void mlpack::RPlusTreeSplit<SplitPolicyType, SweepType>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicyType = mlpack::RPlusTreeSplitPolicy; SweepType = mlpack::MinimalCoverageSweep]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:535:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp:60:22: required from ‘static void mlpack::RPlusTreeSplit<SplitPolicyType, SweepType>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicyType = mlpack::RPlusPlusTreeSplitPolicy; SweepType = mlpack::MinimalSplitsNumberSweep]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:538:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const mlpack::DiscreteHilbertValue<TreeElemType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:40:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:191:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split_impl.hpp:34:22: required from ‘static void mlpack::HilbertRTreeSplit<splitOrder>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; unsigned int splitOrder = 2]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:117:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = arma::Mat<double>; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:107:36: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(mlpack::NeighborSearchMode, double, MetricType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:108:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NSWrapper(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:532:17: required from ‘void mlpack::NSModel<SortPolicy>::InitializeModel(mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:608:3: required from ‘void mlpack::NSModel<SortPolicy>::BuildModel(mlpack::util::Timers&, arma::mat&&, mlpack::NeighborSearchMode, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:243:20: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
83 | localHilbertValues = new arma::Mat<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
84 | *other.LocalHilbertValues());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
90 | valueToInsert = new arma::Col<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
91 | *other.ValueToInsert());
| ~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree() [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>]’:
/usr/include/cereal/access.hpp:317:16: required from ‘static T* cereal::access::construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >]’
/usr/include/cereal/details/traits.hpp:1364:46: required from ‘static T* cereal::detail::Construct<T, A, false, false, false, false>::load_andor_construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >; A = cereal::BinaryInputArchive]’
/usr/include/cereal/types/memory.hpp:411:101: required from ‘typename std::enable_if<(! cereal::traits::has_load_and_construct<T, Archive>::value), void>::type cereal::load(Archive&, memory_detail::PtrWrapper<std::unique_ptr<T, D>&>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > >; typename std::enable_if<(! traits::has_load_and_construct<T, Archive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/types/memory.hpp:253:7: required from ‘typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type cereal::load(Archive&, std::unique_ptr<T, D>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > >; typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/cereal/pointer_wrapper.hpp:65:7: required from ‘void cereal::PointerWrapper<T>::load(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:287:43: required from ‘static decltype (t.load(ar, version)) cereal::access::member_load(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > >; decltype (t.load(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1058:28: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > >; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > >}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:935:7: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:245:7: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::LeafSizeNSWrapper<mlpack::FurthestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::LeafSizeNSWrapper<mlpack::FurthestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::LeafSizeNSWrapper<mlpack::FurthestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::LeafSizeNSWrapper<mlpack::FurthestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::LeafSizeNSWrapper<mlpack::FurthestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::LeafSizeNSWrapper<mlpack::FurthestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::LeafSizeNSWrapper<mlpack::FurthestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::LeafSizeNSWrapper<mlpack::FurthestNS, mlpack::Octree, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:461:11: required from ‘void mlpack::NSModel<SortPolicy>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; SortPolicy = mlpack::FurthestNS; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::NSModel<mlpack::FurthestNS>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::NSModel<mlpack::FurthestNS>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::NSModel<mlpack::FurthestNS>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::NSModel<mlpack::FurthestNS>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::NSModel<mlpack::FurthestNS>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::NSModel<mlpack::FurthestNS>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::NSModel<mlpack::FurthestNS>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::NSModel<mlpack::FurthestNS>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/data/load_model_impl.hpp:95:9: required from ‘bool mlpack::data::Load(const std::string&, const std::string&, T&, bool, format) [with T = mlpack::NSModel<mlpack::FurthestNS>; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:124:15: required from ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::NSModel<mlpack::FurthestNS>; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::NSModel<mlpack::FurthestNS>*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::NSModel<mlpack::FurthestNS>*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/kfn_main.cpp:83:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
475 | dataset(new MatType()),
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(mlpack::Octree<MetricType, StatisticType, MatType>&&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:132:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
422 | other.dataset = new MatType();
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; Tree = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
154 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::UBTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’} with extended alignment 16 [-Waligned-new=]
125 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(Tree) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:132:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::UBTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’} with extended alignment 16 [-Waligned-new=]
347 | this->referenceTree = new Tree(std::move(referenceTree));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::SpillNSWrapper<SortPolicy>* mlpack::SpillNSWrapper<SortPolicy>::Clone() const [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:293:27: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; Tree = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:228:14: required from ‘void mlpack::SpillNSWrapper<SortPolicy>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:210:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:234:14: required from ‘void mlpack::SpillNSWrapper<SortPolicy>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:210:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::VPTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’} with extended alignment 16 [-Waligned-new=]
125 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(Tree) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:132:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::VPTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’} with extended alignment 16 [-Waligned-new=]
347 | this->referenceTree = new Tree(std::move(referenceTree));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
125 | referenceTree(other.referenceTree ? new Tree(*other.referenceTree) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(Tree) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:132:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: warning: ‘new’ of type ‘mlpack::NeighborSearch<mlpack::FurthestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::BallTree, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’} with extended alignment 16 [-Waligned-new=]
347 | this->referenceTree = new Tree(std::move(referenceTree));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:347:25: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:42:11: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:31:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; Tree = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:74:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:80:14: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
127 | new MatType(*other.referenceSet)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:127:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(MatType) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:123:13: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Train(mlpack::util::Timers&, arma::mat&&, size_t, double, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:113:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
318 | referenceSet = new MatType(std::move(referenceSetIn));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:318:20: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(Tree&, size_t, arma::Mat<unsigned int>&, arma::mat&, bool) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:171:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
599 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:599:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
396 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:396:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
397 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:397:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
400 | neighborPtr = new arma::Mat<size_t>; // Reference indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:400:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp: In instantiation of ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
678 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:678:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
679 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:679:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const mlpack::Octree<MetricType, StatisticType, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
348 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:348:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:28:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
28 | dataset(new MatType(dataset)),
| ^~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:28:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:28:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In instantiation of ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; HyperplaneType = mlpack::AxisOrthogonalHyperplane; SplitType = mlpack::MidpointSpaceSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::SPTree; DualTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistDualTreeTraverser; SingleTreeTraversalType = mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit>::DefeatistSingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::SpillNSWrapper<SortPolicy>* mlpack::SpillNSWrapper<SortPolicy>::Clone() const [with SortPolicy = mlpack::FurthestNS]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:293:27: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:152:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
152 | new MatType(*other.dataset) : other.dataset),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:152:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:152:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:19: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPlusTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::HilbertRTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::XTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
349 | left = new BinarySpaceTree(*other.Left());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:349:12: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
355 | right = new BinarySpaceTree(*other.Right());
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:355:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:70:33: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:56:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RStarTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RTree; DualTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser; SingleTreeTraversalType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(const mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::StandardCoverTree; DualTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser; SingleTreeTraversalType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:118:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
509 | new MatType(*other.dataset) : other.dataset),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:509:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:125:41: required from ‘mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::NeighborSearch(const mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:101:7: required from ‘mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>* mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Clone() const [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model.hpp:218:30: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
344 | dataset((other.parent == NULL) ? new MatType(*other.dataset) : NULL)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:344:38: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:750:14: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:101:12: required from ‘void mlpack::NSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:93:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
41 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:41:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = Octree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double> >; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::Octree; DualTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::DualTreeTraverser; SingleTreeTraversalType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> >::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
66 | dataset(new MatType(dataset)),
| ^~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::UBTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMaxSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HRectBound, RPTreeMaxSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::MaxRPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::RPTreeMeanSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HRectBound, RPTreeMeanSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::RPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HollowBallBound; SplitType = mlpack::VPTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HollowBallBound, VPTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::VPTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::BallBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, BallBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::BallTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, NeighborSearchStat<FurthestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp:452:40: required from ‘void mlpack::NeighborSearch<SortPolicy, MetricType, MatType, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::FurthestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:186:14: required from ‘void mlpack::LeafSizeNSWrapper<SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t, double) [with SortPolicy = mlpack::FurthestNS; TreeType = mlpack::KDTree; DualTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::DualTreeTraverser; SingleTreeTraversalType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>::SingleTreeTraverser; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/neighbor_search/ns_model_impl.hpp:146:6: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::BallBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HollowBallBound, mlpack::VPTreeSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMeanSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::RPTreeMaxSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::SpillTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::AxisOrthogonalHyperplane, mlpack::MidpointSpaceSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double> > >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<double*, vector<double> >; _Distance = int; _Tp = double; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:73:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/string:51,
from /usr/include/c++/13/stdexcept:39,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:34:
/usr/include/c++/13/bits/stl_algobase.h: In function ‘void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >]’:
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Distance = int; _Tp = pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1942 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:497:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:658:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Distance = int; _Tp = pair<arma::Col<long long unsigned int>, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1910:25,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/bits/stl_algo.h:1635:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1635 | std::__make_heap(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1911:23,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/bits/stl_heap.h:425:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
425 | std::__pop_heap(__first, __last, __last, __comp);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool mlpack::UBTreeSplit<BoundType, MatType>::SplitNode(BoundType&, MatType&, size_t, size_t, SplitInfo&) [with BoundType = mlpack::CellBound<mlpack::LMetric<2, true> >; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/ub_tree_split_impl.hpp:36:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool mlpack::UBTreeSplit<BoundType, MatType>::SplitNode(BoundType&, MatType&, size_t, size_t, SplitInfo&) [with BoundType = mlpack::CellBound<mlpack::LMetric<2, true> >; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/ub_tree_split_impl.hpp:36:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:66:
/usr/include/c++/13/bits/stl_vector.h: In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:118:49:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:134:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::SingleTreeTraverser<RuleType>::Traverse(size_t, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/single_tree_traverser_impl.hpp:191:51:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:115:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::DualTreeTraverser<RuleType>::Traverse(mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/dual_tree_traverser_impl.hpp:150:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Distance = int; _Tp = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SingleTreeTraverser<RuleType>::Traverse(size_t, const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/single_tree_traverser_impl.hpp:69:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::SingleTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:305:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::ReferenceRecursion(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:347:64:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:177:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:206:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:230:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1950:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1950 | std::__final_insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::PruneMap(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&, std::map<int, std::vector<DualCoverTreeMapEntry>, std::greater<int> >&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:259:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’,
inlined from ‘void mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::DualTreeTraverser<RuleType>::Traverse(mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&, mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>&) [with RuleType = mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >; MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::NeighborSearchStat<mlpack::FurthestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp:57:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::NeighborSearchRules<mlpack::FurthestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::NeighborSearchStat<mlpack::FurthestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 19%] Linking CXX executable ../../../bin/mlpack_kfn
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_kfn.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_kfn.dir/neighbor_search/kfn_main.cpp.o -o ../../../bin/mlpack_kfn /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 19%] Built target mlpack_kfn
make -f src/mlpack/methods/CMakeFiles/mlpack_nmf.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_nmf.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_nmf.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_nmf.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_nmf.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 19%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_nmf.dir/nmf/nmf_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_nmf.dir/nmf/nmf_main.cpp.o -MF CMakeFiles/mlpack_nmf.dir/nmf/nmf_main.cpp.o.d -o CMakeFiles/mlpack_nmf.dir/nmf/nmf_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/nmf/nmf_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/nmf/nmf_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Col<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 20%] Linking CXX executable ../../../bin/mlpack_nmf
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_nmf.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_nmf.dir/nmf/nmf_main.cpp.o -o ../../../bin/mlpack_nmf /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 20%] Built target mlpack_nmf
make -f src/mlpack/methods/CMakeFiles/mlpack_pca.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_pca.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_pca.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_pca.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_pca.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 20%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_pca.dir/pca/pca_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_pca.dir/pca/pca_main.cpp.o -MF CMakeFiles/mlpack_pca.dir/pca/pca_main.cpp.o.d -o CMakeFiles/mlpack_pca.dir/pca/pca_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/pca/pca_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/pca/pca_main.cpp:13:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd.hpp:124,
from /<<PKGBUILDDIR>>/src/mlpack/methods/pca/decomposition_policies/quic_svd_method.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/methods/pca/decomposition_policies/decomposition_policies.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/methods/pca/pca.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/methods/pca/pca_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp: In constructor ‘mlpack::QUIC_SVD::QUIC_SVD(double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:32:18: warning: unused parameter ‘epsilon’ [-Wunused-parameter]
32 | const double epsilon,
| ~~~~~~~~~~~~~^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:33:18: warning: unused parameter ‘delta’ [-Wunused-parameter]
33 | const double delta)
| ~~~~~~~~~~~~~^~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp: In member function ‘void mlpack::QUIC_SVD::Apply(const arma::mat&, arma::mat&, arma::mat&, arma::mat&, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:50:51: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
50 | ctree = new CosineTree(dataset, epsilon, delta);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:50:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:50:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:52:55: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
52 | ctree = new CosineTree(dataset.t(), epsilon, delta);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:52:55: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/quic_svd/quic_svd_impl.hpp:52:55: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 20%] Linking CXX executable ../../../bin/mlpack_pca
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_pca.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_pca.dir/pca/pca_main.cpp.o -o ../../../bin/mlpack_pca /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 20%] Built target mlpack_pca
make -f src/mlpack/methods/CMakeFiles/mlpack_perceptron.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_perceptron.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_perceptron.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_perceptron.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_perceptron.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 20%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_perceptron.dir/perceptron/perceptron_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_perceptron.dir/perceptron/perceptron_main.cpp.o -MF CMakeFiles/mlpack_perceptron.dir/perceptron/perceptron_main.cpp.o.d -o CMakeFiles/mlpack_perceptron.dir/perceptron/perceptron_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/perceptron/perceptron_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/perceptron/perceptron_main.cpp:15:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/perceptron/perceptron_main.cpp: In function ‘void perceptron(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/perceptron/perceptron_main.cpp:184:29: warning: ‘new’ of type ‘PerceptronModel’ with extended alignment 16 [-Waligned-new=]
184 | p = new PerceptronModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/perceptron/perceptron_main.cpp:184:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/perceptron/perceptron_main.cpp:184:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/perceptron/perceptron_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = PerceptronModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = PerceptronModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = PerceptronModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/perceptron/perceptron_main.cpp:141:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘PerceptronModel’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 21%] Linking CXX executable ../../../bin/mlpack_perceptron
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_perceptron.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_perceptron.dir/perceptron/perceptron_main.cpp.o -o ../../../bin/mlpack_perceptron /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 21%] Built target mlpack_perceptron
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_split.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_split.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_preprocess_split.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_split.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_split.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 21%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_preprocess_split.dir/preprocess/preprocess_split_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_preprocess_split.dir/preprocess/preprocess_split_main.cpp.o -MF CMakeFiles/mlpack_preprocess_split.dir/preprocess/preprocess_split_main.cpp.o.d -o CMakeFiles/mlpack_preprocess_split.dir/preprocess/preprocess_split_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_split_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_split_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 21%] Linking CXX executable ../../../bin/mlpack_preprocess_split
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_preprocess_split.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_preprocess_split.dir/preprocess/preprocess_split_main.cpp.o -o ../../../bin/mlpack_preprocess_split /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 21%] Built target mlpack_preprocess_split
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_binarize.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_binarize.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_preprocess_binarize.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_binarize.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_binarize.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 21%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_preprocess_binarize.dir/preprocess/preprocess_binarize_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_preprocess_binarize.dir/preprocess/preprocess_binarize_main.cpp.o -MF CMakeFiles/mlpack_preprocess_binarize.dir/preprocess/preprocess_binarize_main.cpp.o.d -o CMakeFiles/mlpack_preprocess_binarize.dir/preprocess/preprocess_binarize_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_binarize_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_binarize_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 21%] Linking CXX executable ../../../bin/mlpack_preprocess_binarize
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_preprocess_binarize.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_preprocess_binarize.dir/preprocess/preprocess_binarize_main.cpp.o -o ../../../bin/mlpack_preprocess_binarize /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 21%] Built target mlpack_preprocess_binarize
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_describe.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_describe.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_preprocess_describe.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_describe.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_describe.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 22%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_preprocess_describe.dir/preprocess/preprocess_describe_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_preprocess_describe.dir/preprocess/preprocess_describe_main.cpp.o -MF CMakeFiles/mlpack_preprocess_describe.dir/preprocess/preprocess_describe_main.cpp.o.d -o CMakeFiles/mlpack_preprocess_describe.dir/preprocess/preprocess_describe_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_describe_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_describe_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<double*, vector<double> >; _Distance = int; _Tp = double; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 22%] Linking CXX executable ../../../bin/mlpack_preprocess_describe
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_preprocess_describe.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_preprocess_describe.dir/preprocess/preprocess_describe_main.cpp.o -o ../../../bin/mlpack_preprocess_describe /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 22%] Built target mlpack_preprocess_describe
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_scale.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_scale.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_preprocess_scale.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_scale.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_scale.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 22%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_preprocess_scale.dir/preprocess/preprocess_scale_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_preprocess_scale.dir/preprocess/preprocess_scale_main.cpp.o -MF CMakeFiles/mlpack_preprocess_scale.dir/preprocess/preprocess_scale_main.cpp.o.d -o CMakeFiles/mlpack_preprocess_scale.dir/preprocess/preprocess_scale_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_scale_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_scale_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model.hpp:141,
from /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_scale_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp: In copy constructor ‘mlpack::data::ScalingModel::ScalingModel(const mlpack::data::ScalingModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:43:50: warning: ‘new’ of type ‘mlpack::data::MinMaxScaler’ with extended alignment 16 [-Waligned-new=]
43 | new data::MinMaxScaler(*other.minmaxscale)),
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:43:50: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:43:50: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:45:50: warning: ‘new’ of type ‘mlpack::data::MaxAbsScaler’ with extended alignment 16 [-Waligned-new=]
45 | new data::MaxAbsScaler(*other.maxabsscale)),
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:45:50: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:45:50: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:47:53: warning: ‘new’ of type ‘mlpack::data::MeanNormalization’ with extended alignment 16 [-Waligned-new=]
47 | new data::MeanNormalization(*other.meanscale)),
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:47:53: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:47:53: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:49:54: warning: ‘new’ of type ‘mlpack::data::StandardScaler’ with extended alignment 16 [-Waligned-new=]
49 | new data::StandardScaler(*other.standardscale)),
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:49:54: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:49:54: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:51:47: warning: ‘new’ of type ‘mlpack::data::PCAWhitening’ with extended alignment 16 [-Waligned-new=]
51 | new data::PCAWhitening(*other.pcascale)),
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:51:47: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:51:47: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:53:47: warning: ‘new’ of type ‘mlpack::data::ZCAWhitening’ with extended alignment 16 [-Waligned-new=]
53 | new data::ZCAWhitening(*other.zcascale)),
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:53:47: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:53:47: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp: In member function ‘mlpack::data::ScalingModel& mlpack::data::ScalingModel::operator=(const mlpack::data::ScalingModel&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:97:48: warning: ‘new’ of type ‘mlpack::data::MinMaxScaler’ with extended alignment 16 [-Waligned-new=]
97 | new data::MinMaxScaler(*other.minmaxscale);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:97:48: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:97:48: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:101:48: warning: ‘new’ of type ‘mlpack::data::MaxAbsScaler’ with extended alignment 16 [-Waligned-new=]
101 | new data::MaxAbsScaler(*other.maxabsscale);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:101:48: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:101:48: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:105:52: warning: ‘new’ of type ‘mlpack::data::StandardScaler’ with extended alignment 16 [-Waligned-new=]
105 | new data::StandardScaler(*other.standardscale);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:105:52: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:105:52: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:109:51: warning: ‘new’ of type ‘mlpack::data::MeanNormalization’ with extended alignment 16 [-Waligned-new=]
109 | new data::MeanNormalization(*other.meanscale);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:109:51: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:109:51: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:113:45: warning: ‘new’ of type ‘mlpack::data::PCAWhitening’ with extended alignment 16 [-Waligned-new=]
113 | new data::PCAWhitening(*other.pcascale);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:113:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:113:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:117:45: warning: ‘new’ of type ‘mlpack::data::ZCAWhitening’ with extended alignment 16 [-Waligned-new=]
117 | new data::ZCAWhitening(*other.zcascale);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:117:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:117:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp: In member function ‘void mlpack::data::ScalingModel::Fit(const MatType&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:172:46: warning: ‘new’ of type ‘mlpack::data::StandardScaler’ with extended alignment 16 [-Waligned-new=]
172 | standardscale = new data::StandardScaler();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:172:46: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:172:46: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:178:60: warning: ‘new’ of type ‘mlpack::data::MinMaxScaler’ with extended alignment 16 [-Waligned-new=]
178 | minmaxscale = new data::MinMaxScaler(minValue, maxValue);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:178:60: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:178:60: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:184:45: warning: ‘new’ of type ‘mlpack::data::MeanNormalization’ with extended alignment 16 [-Waligned-new=]
184 | meanscale = new data::MeanNormalization();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:184:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:184:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:190:42: warning: ‘new’ of type ‘mlpack::data::MaxAbsScaler’ with extended alignment 16 [-Waligned-new=]
190 | maxabsscale = new data::MaxAbsScaler();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:190:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:190:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:196:46: warning: ‘new’ of type ‘mlpack::data::PCAWhitening’ with extended alignment 16 [-Waligned-new=]
196 | pcascale = new data::PCAWhitening(epsilon);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:196:46: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:196:46: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:202:46: warning: ‘new’ of type ‘mlpack::data::ZCAWhitening’ with extended alignment 16 [-Waligned-new=]
202 | zcascale = new data::ZCAWhitening(epsilon);
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:202:46: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:202:46: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp: In instantiation of ‘void mlpack::data::ScalingModel::Fit(const MatType&) [with MatType = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_scale_main.cpp:169:13: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:172:21: warning: ‘new’ of type ‘mlpack::data::StandardScaler’ with extended alignment 16 [-Waligned-new=]
172 | standardscale = new data::StandardScaler();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:172:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:172:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:178:19: warning: ‘new’ of type ‘mlpack::data::MinMaxScaler’ with extended alignment 16 [-Waligned-new=]
178 | minmaxscale = new data::MinMaxScaler(minValue, maxValue);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:178:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:178:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:184:17: warning: ‘new’ of type ‘mlpack::data::MeanNormalization’ with extended alignment 16 [-Waligned-new=]
184 | meanscale = new data::MeanNormalization();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:184:17: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:184:17: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:190:19: warning: ‘new’ of type ‘mlpack::data::MaxAbsScaler’ with extended alignment 16 [-Waligned-new=]
190 | maxabsscale = new data::MaxAbsScaler();
| ^~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:190:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:190:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:196:16: warning: ‘new’ of type ‘mlpack::data::PCAWhitening’ with extended alignment 16 [-Waligned-new=]
196 | pcascale = new data::PCAWhitening(epsilon);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:196:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:196:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:202:16: warning: ‘new’ of type ‘mlpack::data::ZCAWhitening’ with extended alignment 16 [-Waligned-new=]
202 | zcascale = new data::ZCAWhitening(epsilon);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:202:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/scaling_model_impl.hpp:202:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 23%] Linking CXX executable ../../../bin/mlpack_preprocess_scale
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_preprocess_scale.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_preprocess_scale.dir/preprocess/preprocess_scale_main.cpp.o -o ../../../bin/mlpack_preprocess_scale /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 23%] Built target mlpack_preprocess_scale
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 24%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/preprocess/preprocess_one_hot_encoding_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/preprocess/preprocess_one_hot_encoding_main.cpp.o -MF CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/preprocess/preprocess_one_hot_encoding_main.cpp.o.d -o CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/preprocess/preprocess_one_hot_encoding_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_one_hot_encoding_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/preprocess/preprocess_one_hot_encoding_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 24%] Linking CXX executable ../../../bin/mlpack_preprocess_one_hot_encoding
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_preprocess_one_hot_encoding.dir/preprocess/preprocess_one_hot_encoding_main.cpp.o -o ../../../bin/mlpack_preprocess_one_hot_encoding /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 24%] Built target mlpack_preprocess_one_hot_encoding
make -f src/mlpack/methods/CMakeFiles/mlpack_radical.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_radical.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_radical.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_radical.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_radical.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 24%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_radical.dir/radical/radical_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_radical.dir/radical/radical_main.cpp.o -MF CMakeFiles/mlpack_radical.dir/radical/radical_main.cpp.o.d -o CMakeFiles/mlpack_radical.dir/radical/radical_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/radical/radical_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/radical/radical_main.cpp:13:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 25%] Linking CXX executable ../../../bin/mlpack_radical
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_radical.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_radical.dir/radical/radical_main.cpp.o -o ../../../bin/mlpack_radical /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 25%] Built target mlpack_radical
make -f src/mlpack/methods/CMakeFiles/mlpack_random_forest.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_random_forest.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_random_forest.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_random_forest.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_random_forest.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 25%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_random_forest.dir/random_forest/random_forest_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_random_forest.dir/random_forest/random_forest_main.cpp.o -MF CMakeFiles/mlpack_random_forest.dir/random_forest/random_forest_main.cpp.o.d -o CMakeFiles/mlpack_random_forest.dir/random_forest/random_forest_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_main.cpp:12:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree.hpp:616,
from /<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp: In instantiation of ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType&, size_t, size_t, const mlpack::data::DatasetInfo&, arma::Row<unsigned int>&, size_t, arma::rowvec&, size_t, double, size_t, DimensionSelectionType&) [with bool UseWeights = true; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false; size_t = unsigned int; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; arma::rowvec = arma::Row<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:562:21: required from ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType, const mlpack::data::DatasetInfo&, LabelsType, size_t, WeightsType, size_t, double, size_t, DimensionSelectionType, std::enable_if_t<arma::is_arma_type<typename std::remove_reference<WeightsType>::type>::value>*) [with MatType = arma::Mat<double>; LabelsType = arma::Row<unsigned int>; WeightsType = arma::Row<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int; std::enable_if_t<arma::is_arma_type<typename std::remove_reference<WeightsType>::type>::value> = void; typename std::remove_reference<WeightsType>::type = arma::Row<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:542:41: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const mlpack::data::DatasetInfo&, const arma::Row<unsigned int>&, size_t, const arma::rowvec&, size_t, size_t, double, size_t, DimensionSelectionType&, bool) [with bool UseWeights = false; bool UseDatasetInfo = false; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int; arma::rowvec = arma::Row<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:194:29: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const arma::Row<unsigned int>&, size_t, size_t, size_t, double, size_t, bool, DimensionSelectionType) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_main.cpp:258:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: warning: ‘new’ of type ‘mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>’ with extended alignment 16 [-Waligned-new=]
761 | DecisionTree* child = new DecisionTree();
| ^~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp: In instantiation of ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType&, size_t, size_t, arma::Row<unsigned int>&, size_t, arma::rowvec&, size_t, double, size_t, DimensionSelectionType&) [with bool UseWeights = true; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false; size_t = unsigned int; arma::rowvec = arma::Row<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:608:21: required from ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType, LabelsType, size_t, WeightsType, size_t, double, size_t, DimensionSelectionType, std::enable_if_t<arma::is_arma_type<typename std::remove_reference<WeightsType>::type>::value>*) [with MatType = arma::Mat<double>; LabelsType = arma::Row<unsigned int>; WeightsType = arma::Row<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false; size_t = unsigned int; std::enable_if_t<arma::is_arma_type<typename std::remove_reference<WeightsType>::type>::value> = void; typename std::remove_reference<WeightsType>::type = arma::Row<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:552:41: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const mlpack::data::DatasetInfo&, const arma::Row<unsigned int>&, size_t, const arma::rowvec&, size_t, size_t, double, size_t, DimensionSelectionType&, bool) [with bool UseWeights = false; bool UseDatasetInfo = false; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int; arma::rowvec = arma::Row<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:194:29: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const arma::Row<unsigned int>&, size_t, size_t, size_t, double, size_t, bool, DimensionSelectionType) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_main.cpp:258:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:919:29: warning: ‘new’ of type ‘mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>’ with extended alignment 16 [-Waligned-new=]
919 | DecisionTree* child = new DecisionTree();
| ^~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:919:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:919:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp: In instantiation of ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType&, size_t, size_t, const mlpack::data::DatasetInfo&, arma::Row<unsigned int>&, size_t, arma::rowvec&, size_t, double, size_t, DimensionSelectionType&) [with bool UseWeights = false; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false; size_t = unsigned int; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; arma::rowvec = arma::Row<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:475:22: required from ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType, const mlpack::data::DatasetInfo&, LabelsType, size_t, size_t, double, size_t, DimensionSelectionType) [with MatType = arma::Mat<double>; LabelsType = arma::Row<unsigned int>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:565:41: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const mlpack::data::DatasetInfo&, const arma::Row<unsigned int>&, size_t, const arma::rowvec&, size_t, size_t, double, size_t, DimensionSelectionType&, bool) [with bool UseWeights = false; bool UseDatasetInfo = false; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int; arma::rowvec = arma::Row<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:194:29: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const arma::Row<unsigned int>&, size_t, size_t, size_t, double, size_t, bool, DimensionSelectionType) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_main.cpp:258:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: warning: ‘new’ of type ‘mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>’ with extended alignment 16 [-Waligned-new=]
761 | DecisionTree* child = new DecisionTree();
| ^~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:761:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp: In instantiation of ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType&, size_t, size_t, arma::Row<unsigned int>&, size_t, arma::rowvec&, size_t, double, size_t, DimensionSelectionType&) [with bool UseWeights = false; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false; size_t = unsigned int; arma::rowvec = arma::Row<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:515:22: required from ‘double mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::Train(MatType, LabelsType, size_t, size_t, double, size_t, DimensionSelectionType) [with MatType = arma::Mat<double>; LabelsType = arma::Row<unsigned int>; FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:575:41: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const mlpack::data::DatasetInfo&, const arma::Row<unsigned int>&, size_t, const arma::rowvec&, size_t, size_t, double, size_t, DimensionSelectionType&, bool) [with bool UseWeights = false; bool UseDatasetInfo = false; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int; arma::rowvec = arma::Row<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:194:29: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const arma::Row<unsigned int>&, size_t, size_t, size_t, double, size_t, bool, DimensionSelectionType) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_main.cpp:258:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:919:29: warning: ‘new’ of type ‘mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>’ with extended alignment 16 [-Waligned-new=]
919 | DecisionTree* child = new DecisionTree();
| ^~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:919:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:919:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp: In instantiation of ‘mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>::DecisionTree(const mlpack::DecisionTree<FitnessFunction, NumericSplitType, CategoricalSplitType, DimensionSelectionType, NoRecursion>&) [with FitnessFunction = mlpack::GiniGain; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; bool NoRecursion = false]’:
/usr/include/c++/13/bits/stl_construct.h:119:7: required from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>; _Args = {const mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>&}]’
/usr/include/c++/13/bits/stl_uninitialized.h:120:21: required from ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*; _ForwardIterator = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*]’
/usr/include/c++/13/bits/stl_uninitialized.h:137:32: required from ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*; _ForwardIterator = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*; bool _TrivialValueTypes = false]’
/usr/include/c++/13/bits/stl_uninitialized.h:185:15: required from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*; _ForwardIterator = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*]’
/usr/include/c++/13/bits/stl_uninitialized.h:373:37: required from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = const mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*; _ForwardIterator = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*; _Tp = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>]’
/usr/include/c++/13/bits/stl_uninitialized.h:399:2: required from ‘_ForwardIterator std::__uninitialized_move_if_noexcept_a(_InputIterator, _InputIterator, _ForwardIterator, _Allocator&) [with _InputIterator = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*; _ForwardIterator = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>*; _Allocator = allocator<mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false> >]’
/usr/include/c++/13/bits/vector.tcc:687:48: required from ‘void std::vector<_Tp, _Alloc>::_M_default_append(size_type) [with _Tp = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>; _Alloc = std::allocator<mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false> >; size_type = unsigned int]’
/usr/include/c++/13/bits/stl_vector.h:1013:4: required from ‘void std::vector<_Tp, _Alloc>::resize(size_type) [with _Tp = mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>; _Alloc = std::allocator<mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false> >; size_type = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:501:15: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const mlpack::data::DatasetInfo&, const arma::Row<unsigned int>&, size_t, const arma::rowvec&, size_t, size_t, double, size_t, DimensionSelectionType&, bool) [with bool UseWeights = false; bool UseDatasetInfo = false; MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; mlpack::data::DatasetInfo = mlpack::data::DatasetMapper<mlpack::data::IncrementPolicy, std::__cxx11::basic_string<char> >; size_t = unsigned int; arma::rowvec = arma::Row<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_impl.hpp:194:29: required from ‘double mlpack::RandomForest<FitnessFunction, DimensionSelectionType, NumericSplitType, CategoricalSplitType, UseBootstrap>::Train(const MatType&, const arma::Row<unsigned int>&, size_t, size_t, size_t, double, size_t, bool, DimensionSelectionType) [with MatType = arma::Mat<double>; FitnessFunction = mlpack::GiniGain; DimensionSelectionType = mlpack::MultipleRandomDimensionSelect; NumericSplitType = mlpack::BestBinaryNumericSplit; CategoricalSplitType = mlpack::AllCategoricalSplit; bool UseBootstrap = true; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/random_forest/random_forest_main.cpp:258:22: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:297:24: warning: ‘new’ of type ‘mlpack::DecisionTree<mlpack::GiniGain, mlpack::BestBinaryNumericSplit, mlpack::AllCategoricalSplit, mlpack::MultipleRandomDimensionSelect, false>’ with extended alignment 16 [-Waligned-new=]
297 | children.push_back(new DecisionTree(*other.children[i]));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:297:24: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/decision_tree/decision_tree_impl.hpp:297:24: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = subview<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 25%] Linking CXX executable ../../../bin/mlpack_random_forest
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/cmake -E cmake_link_script CMakeFiles/mlpack_random_forest.dir/link.txt --verbose=1
/usr/bin/c++ -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -Wl,-z,relro -Wl,-z,now CMakeFiles/mlpack_random_forest.dir/random_forest/random_forest_main.cpp.o -o ../../../bin/mlpack_random_forest /usr/lib/libarmadillo.so /usr/lib/gcc/arm-linux-gnueabihf/13/libatomic.so /usr/lib/gcc/arm-linux-gnueabihf/13/libgomp.so /usr/lib/arm-linux-gnueabihf/libpthread.a
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 25%] Built target mlpack_random_forest
make -f src/mlpack/methods/CMakeFiles/mlpack_krann.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_krann.dir/depend
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods/CMakeFiles/mlpack_krann.dir/DependInfo.cmake "--color="
make[3]: Leaving directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
make -f src/mlpack/methods/CMakeFiles/mlpack_krann.dir/build.make src/mlpack/methods/CMakeFiles/mlpack_krann.dir/build
make[3]: Entering directory '/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf'
[ 25%] Building CXX object src/mlpack/methods/CMakeFiles/mlpack_krann.dir/rann/krann_main.cpp.o
cd /<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/src/mlpack/methods && /usr/bin/c++ -DDEBUG -DMLPACK_CUSTOM_CONFIG_FILE=mlpack/config-local.hpp -I/<<PKGBUILDDIR>>/src -I/usr/include/stb -I/<<PKGBUILDDIR>>/obj-arm-linux-gnueabihf/include -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security --param ggc-min-expand=20 -g0 -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -ftemplate-depth=1000 -Wno-unused-function -latomic -g -ftemplate-backtrace-limit=0 -fopenmp -std=gnu++14 -DBINDING_TYPE=BINDING_TYPE_CLI -MD -MT src/mlpack/methods/CMakeFiles/mlpack_krann.dir/rann/krann_main.cpp.o -MF CMakeFiles/mlpack_krann.dir/rann/krann_main.cpp.o.d -o CMakeFiles/mlpack_krann.dir/rann/krann_main.cpp.o -c /<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp
In file included from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:97,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:15,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:35,
from /<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:13:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint32_t core::v2::impl::murmur<4>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:68:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
68 | case 3: hash ^= ::std::uint32_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:69:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
69 | case 2: hash ^= ::std::uint32_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp: In member function ‘uint64_t core::v2::impl::murmur<8>::operator()(const void*, std::size_t) const’:
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:115:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
115 | case 7: hash ^= ::std::uint64_t(data[6]) << 48; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:116:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
116 | case 6: hash ^= ::std::uint64_t(data[5]) << 40; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:117:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
117 | case 5: hash ^= ::std::uint64_t(data[4]) << 32; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:118:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
118 | case 4: hash ^= ::std::uint64_t(data[3]) << 24; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:119:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
119 | case 3: hash ^= ::std::uint64_t(data[2]) << 16; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/std_backport/string_view.hpp:120:55: warning: attributes at the beginning of statement are ignored [-Wattributes]
120 | case 2: hash ^= ::std::uint64_t(data[1]) << 8; [[clang::fallthrough]];
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/data/save_image.hpp:24,
from /<<PKGBUILDDIR>>/src/mlpack/core/data/save.hpp:25,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/io.hpp:32,
from /<<PKGBUILDDIR>>/src/mlpack/prereqs.hpp:38:
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
514 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:514:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_bmp(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
522 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:522:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
613 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:613:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_tga(const char*, int, int, int, const void*)’:
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
621 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:621:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr_to_func(void (*)(void*, void*, int), void*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
789 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:789:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_hdr(const char*, int, int, int, const float*)’:
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
796 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:796:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg_to_func(void (*)(void*, void*, int), void*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1609 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1609:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h: In function ‘int stbi_write_jpg(const char*, int, int, int, const void*, int)’:
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::context’ [-Wmissing-field-initializers]
1618 | stbi__write_context s = { 0 };
| ^
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buffer’ [-Wmissing-field-initializers]
/usr/include/stb/stb_image_write.h:1618:32: warning: missing initializer for member ‘stbi__write_context::buf_used’ [-Wmissing-field-initializers]
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp:289,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:18,
from /<<PKGBUILDDIR>>/src/mlpack/core.hpp:53:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In copy constructor ‘mlpack::CosineTree::CosineTree(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
162 | dataset((other.parent == NULL) ? new arma::mat(*other.dataset) : NULL),
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:162:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
180 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:180:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
186 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:186:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘mlpack::CosineTree& mlpack::CosineTree::operator=(const mlpack::CosineTree&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
227 | dataset = (other.parent == NULL) ? new arma::mat(*other.dataset) : NULL;
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:227:66: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
246 | left = new CosineTree(*other.Left());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:246:40: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
252 | right = new CosineTree(*other.Right());
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:252:42: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp: In member function ‘void mlpack::CosineTree::CosineNodeSplit()’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
542 | left = new CosineTree(*this, leftIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:542:43: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: warning: ‘new’ of type ‘mlpack::CosineTree’ with extended alignment 16 [-Waligned-new=]
543 | right = new CosineTree(*this, rightIndices);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cosine_tree/cosine_tree_impl.hpp:543:45: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree.hpp:491,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/is_spill_tree.hpp:14,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:23:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In copy constructor ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SpillTree(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
170 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:170:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>& mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::operator=(const mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>&)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
251 | pointsIndex = new arma::Col<size_t>(*other.pointsIndex);
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:251:59: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp: In member function ‘void mlpack::SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::SplitNode(arma::Col<unsigned int>&, size_t, double, double)’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
734 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:734:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
745 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:745:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: warning: ‘new’ of type ‘arma::Col<unsigned int>’ with extended alignment 16 [-Waligned-new=]
758 | pointsIndex = new arma::Col<size_t>();
| ^
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp:758:41: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search.hpp:401,
from /<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:20:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In member function ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:31: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:31: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:31: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:31: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In member function ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In member function ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:29: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:29: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:29: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:29: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp: In function ‘void krann(mlpack::util::Params&, mlpack::util::Timers&)’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:174:24: warning: ‘new’ of type ‘mlpack::RAModel’ with extended alignment 16 [-Waligned-new=]
174 | rann = new RAModel();
| ^
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:174:24: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:174:24: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::StandardCoverTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:113:68: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
105 | referenceSet(new MatType()),
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:116:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:119:60: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:122:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:125:63: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:128:60: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:131:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:219:44: required from ‘mlpack::LeafSizeRAWrapper<TreeType>::LeafSizeRAWrapper(bool, bool) [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:110:65: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:219:44: required from ‘mlpack::LeafSizeRAWrapper<TreeType>::LeafSizeRAWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:134:65: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:219:44: required from ‘mlpack::LeafSizeRAWrapper<TreeType>::LeafSizeRAWrapper(bool, bool) [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:137:65: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:105:18: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param_impl.hpp:16,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_printable_param.hpp:82,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/mlpack_main.hpp:27,
from /<<PKGBUILDDIR>>/src/mlpack/core/util/mlpack_main.hpp:39,
from /<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:18:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp: In instantiation of ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::RAModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::RAModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::RAModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:85:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: warning: ‘new’ of type ‘mlpack::RAModel’ with extended alignment 16 [-Waligned-new=]
123 | T* model = new T();
| ^~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:123:16: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp:638,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:20,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:22:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:116:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
67 | dataset(new MatType(data)),
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, RStarTreeSplit, RStarTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RStarTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:119:60: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, XTreeSplit, RTreeDescentHeuristic, XTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::XTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:122:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:125:63: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:128:60: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:131:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:67:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:26:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:219:44: required from ‘mlpack::LeafSizeRAWrapper<TreeType>::LeafSizeRAWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:134:65: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree.hpp:571,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:17:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, HRectBound, MidpointSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:219:44: required from ‘mlpack::LeafSizeRAWrapper<TreeType>::LeafSizeRAWrapper(bool, bool) [with TreeType = mlpack::KDTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:110:65: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
69 | dataset(new MatType(data)) // Copies the dataset.
| ^~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:219:44: required from ‘mlpack::LeafSizeRAWrapper<TreeType>::LeafSizeRAWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:134:65: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:69:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree.hpp:468,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/octree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:21:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = Octree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double> >; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:219:44: required from ‘mlpack::LeafSizeRAWrapper<TreeType>::LeafSizeRAWrapper(bool, bool) [with TreeType = mlpack::Octree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:137:65: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
66 | dataset(new MatType(dataset)),
| ^~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:66:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp:296,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree.hpp:35:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:30:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const TreeType*) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:70:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:125:63: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
46 | new arma::Col<HilbertElemType>(tree->Dataset().n_rows)),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:46:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
61 | localHilbertValues = new arma::Mat<HilbertElemType>(tree->Dataset().n_rows,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
62 | tree->MaxLeafSize() + 1);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:61:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(std::vector<unsigned int>&, size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:78:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(const MatType&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = const arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:219:44: required from ‘mlpack::LeafSizeRAWrapper<TreeType>::LeafSizeRAWrapper(bool, bool) [with TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:134:65: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
974 | left = new BinarySpaceTree(this, begin, splitCol - begin, oldFromNew,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
975 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:974:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
976 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
977 | oldFromNew, splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:976:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp:38:22: required from ‘static void mlpack::RTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:76:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:116:56: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
187 | (parent ? parent->dataset : new MatType(*other.dataset)) :
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split_impl.hpp:34:22: required from ‘static void mlpack::HilbertRTreeSplit<splitOrder>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; unsigned int splitOrder = 2]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:76:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:125:63: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp:60:22: required from ‘static void mlpack::RPlusTreeSplit<SplitPolicyType, SweepType>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicyType = mlpack::RPlusTreeSplitPolicy; SweepType = mlpack::MinimalCoverageSweep]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:76:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusTreeSplitPolicy, MinimalCoverageSweep>, RPlusTreeDescentHeuristic, NoAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:128:60: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_impl.hpp:60:22: required from ‘static void mlpack::RPlusTreeSplit<SplitPolicyType, SweepType>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicyType = mlpack::RPlusPlusTreeSplitPolicy; SweepType = mlpack::MinimalSplitsNumberSweep]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:76:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, RPlusTreeSplit<RPlusPlusTreeSplitPolicy, MinimalSplitsNumberSweep>, RPlusPlusTreeDescentHeuristic, RPlusPlusTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::RPlusPlusTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:131:64: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:187:37: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp: In instantiation of ‘mlpack::DiscreteHilbertValue<TreeElemType>::DiscreteHilbertValue(const mlpack::DiscreteHilbertValue<TreeElemType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; TreeElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information_impl.hpp:40:5: required from ‘mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>::HilbertRTreeAuxiliaryInformation(const mlpack::HilbertRTreeAuxiliaryInformation<TreeType, HilbertValueType>&, TreeType*, bool) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; HilbertValueType = mlpack::DiscreteHilbertValue]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:191:5: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>&, bool, mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>*) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split_impl.hpp:34:22: required from ‘static void mlpack::HilbertRTreeSplit<splitOrder>::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; unsigned int splitOrder = 2]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:1024:29: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::SplitNode(std::vector<bool>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:488:5: required from ‘void mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::InsertPoint(size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:76:22: required from ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(const MatType&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:38:10: required from ‘TreeType* mlpack::BuildTree(MatType&&, const std::vector<unsigned int>&, const typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type*) [with TreeType = RectangleTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, HilbertRTreeSplit<2>, HilbertRTreeDescentHeuristic, DiscreteHilbertRTreeAuxiliaryInformation>; MatType = const arma::Mat<double>&; typename std::enable_if<(! TreeTraits<TreeType>::RearrangesDataset)>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:120:36: required from ‘mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::RASearch(bool, bool, double, double, bool, bool, size_t, MetricType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:117:7: required from ‘mlpack::RAWrapper<TreeType>::RAWrapper(bool, bool) [with TreeType = mlpack::HilbertRTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:125:63: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: warning: ‘new’ of type ‘arma::Mat<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
83 | localHilbertValues = new arma::Mat<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
84 | *other.LocalHilbertValues());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:83:28: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: warning: ‘new’ of type ‘arma::Col<long long unsigned int>’ with extended alignment 16 [-Waligned-new=]
90 | valueToInsert = new arma::Col<HilbertElemType>(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
91 | *other.ValueToInsert());
| ~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp:90:23: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree() [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>]’:
/usr/include/cereal/access.hpp:317:16: required from ‘static T* cereal::access::construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >]’
/usr/include/cereal/details/traits.hpp:1364:46: required from ‘static T* cereal::detail::Construct<T, A, false, false, false, false>::load_andor_construct() [with T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >; A = cereal::BinaryInputArchive]’
/usr/include/cereal/types/memory.hpp:411:101: required from ‘typename std::enable_if<(! cereal::traits::has_load_and_construct<T, Archive>::value), void>::type cereal::load(Archive&, memory_detail::PtrWrapper<std::unique_ptr<T, D>&>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > >; typename std::enable_if<(! traits::has_load_and_construct<T, Archive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::memory_detail::PtrWrapper<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/types/memory.hpp:253:7: required from ‘typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type cereal::load(Archive&, std::unique_ptr<T, D>&) [with Archive = BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >; D = std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > >; typename std::enable_if<(! std::is_polymorphic<T>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:941:34: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<std::unique_ptr<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >, std::default_delete<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > > >&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/cereal/pointer_wrapper.hpp:65:7: required from ‘void cereal::PointerWrapper<T>::load(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:287:43: required from ‘static decltype (t.load(ar, version)) cereal::access::member_load(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > >; decltype (t.load(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1058:28: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > >; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_load<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_load<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > >; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::PointerWrapper<mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > >}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:614:7: required from ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::Octree>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:251:7: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; TreeType = mlpack::Octree; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::LeafSizeRAWrapper<mlpack::Octree>; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::LeafSizeRAWrapper<mlpack::Octree>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::LeafSizeRAWrapper<mlpack::Octree>&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::LeafSizeRAWrapper<mlpack::Octree>&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::LeafSizeRAWrapper<mlpack::Octree>&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::LeafSizeRAWrapper<mlpack::Octree>&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::LeafSizeRAWrapper<mlpack::Octree>&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::LeafSizeRAWrapper<mlpack::Octree>&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:456:11: required from ‘void mlpack::RAModel::serialize(Archive&, uint32_t) [with Archive = cereal::BinaryInputArchive; uint32_t = unsigned int]’
/usr/include/cereal/access.hpp:275:48: required from ‘static decltype (t.serialize(ar, version)) cereal::access::member_serialize(Archive&, T&, uint32_t) [with Archive = cereal::BinaryInputArchive; T = mlpack::RAModel; decltype (t.serialize(ar, version)) = void; uint32_t = unsigned int]’
/usr/include/cereal/cereal.hpp:1038:33: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = mlpack::RAModel; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_member_versioned_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_member_versioned_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = mlpack::RAModel&; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {mlpack::RAModel&}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/archives/binary.hpp:136:7: required from ‘typename std::enable_if<(cereal::traits::is_same_archive<Archive, cereal::BinaryInputArchive>::value || cereal::traits::is_same_archive<Archive, cereal::BinaryOutputArchive>::value), void>::type cereal::serialize(Archive&, NameValuePair<T>&) [with Archive = BinaryInputArchive; T = mlpack::RAModel&; typename std::enable_if<(traits::is_same_archive<Archive, BinaryInputArchive>::value || traits::is_same_archive<Archive, BinaryOutputArchive>::value), void>::type = void]’
/usr/include/cereal/cereal.hpp:925:39: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::processImpl(T&) [with T = cereal::NameValuePair<mlpack::RAModel&>; typename cereal::traits::detail::EnableIfHelper<cereal::traits::has_non_member_serialize<T, ArchiveType>::value, (! cereal::traits::has_invalid_input_versioning<T, ArchiveType>::value), (cereal::traits::is_input_serializable<T, ArchiveType>::value && (cereal::traits::is_specialized_non_member_serialize<T, ArchiveType>::value || (! cereal::traits::is_specialized<T, ArchiveType>::value)))>::type <anonymous> = (cereal::traits::detail::sfinae)0; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:853:26: required from ‘void cereal::InputArchive<ArchiveType, Flags>::process(T&&) [with T = cereal::NameValuePair<mlpack::RAModel&>; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/usr/include/cereal/cereal.hpp:730:16: required from ‘ArchiveType& cereal::InputArchive<ArchiveType, Flags>::operator()(Types&& ...) [with Types = {cereal::NameValuePair<mlpack::RAModel&>}; ArchiveType = cereal::BinaryInputArchive; unsigned int Flags = 1]’
/<<PKGBUILDDIR>>/src/mlpack/core/data/load_model_impl.hpp:95:9: required from ‘bool mlpack::data::Load(const std::string&, const std::string&, T&, bool, format) [with T = mlpack::RAModel; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:124:15: required from ‘T*& mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type*, const typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type*) [with T = mlpack::RAModel; typename std::enable_if<(! arma::is_arma_type<T1>::value)>::type = void; typename std::enable_if<mlpack::data::HasSerialize<T>::value>::type = void]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/get_param.hpp:143:69: required from ‘void mlpack::bindings::cli::GetParam(mlpack::util::ParamData&, const void*, void*) [with T = mlpack::RAModel*]’
/<<PKGBUILDDIR>>/src/mlpack/bindings/cli/cli_option.hpp:117:20: required from ‘mlpack::bindings::cli::CLIOption<N>::CLIOption(N, const std::string&, const std::string&, const std::string&, const std::string&, bool, bool, bool, const std::string&) [with N = mlpack::RAModel*; std::string = std::__cxx11::basic_string<char>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:85:1: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
475 | dataset(new MatType()),
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:475:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:428,
from /<<PKGBUILDDIR>>/src/mlpack/methods/rann/krann_main.cpp:21:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp: In instantiation of ‘void mlpack::LeafSizeRAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:234:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:316:9: warning: ‘new’ of type ‘mlpack::RASearch<mlpack::NearestNS, mlpack::LMetric<2, true>, arma::Mat<double>, mlpack::UBTree>::Tree’ {aka ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’} with extended alignment 16 [-Waligned-new=]
316 | new typename decltype(ra)::Tree(std::move(referenceSet),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
317 | oldFromNewReferences,
| ~~~~~~~~~~~~~~~~~~~~~
318 | leafSize);
| ~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:316:9: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:316:9: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:309:13: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:234:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:316:9: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:234:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
192 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:192:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; Tree = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:354:14: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:240:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:370:14: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:240:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::Octree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::Octree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp: In instantiation of ‘mlpack::Octree<MetricType, StatisticType, MatType>::Octree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::Octree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
154 | dataset(new MatType(std::move(dataset))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/octree/octree_impl.hpp:154:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:309:13: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:234:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:316:9: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:234:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:354:14: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:240:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:370:14: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:240:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::UBTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:251:11: required from ‘void mlpack::RAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RPlusPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:168:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>; DescentType = mlpack::RPlusPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::RPlusPlusTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RPlusPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:275:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RPlusPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:281:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RPlusPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusPlusTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::RPlusPlusTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:251:11: required from ‘void mlpack::RAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:168:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>; DescentType = mlpack::RPlusTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:275:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:281:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RPlusTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RPlusTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::RPlusTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:251:11: required from ‘void mlpack::RAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::HilbertRTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:168:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::HilbertRTreeSplit<2>; DescentType = mlpack::HilbertRTreeDescentHeuristic; AuxiliaryInformationType = mlpack::DiscreteHilbertRTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::HilbertRTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:275:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::HilbertRTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:281:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::HilbertRTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::HilbertRTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::HilbertRTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:251:11: required from ‘void mlpack::RAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::XTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:168:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::XTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::XTreeAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::XTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:275:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::XTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:281:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::XTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::XTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::XTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:251:11: required from ‘void mlpack::RAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RStarTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:168:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RStarTreeSplit; DescentType = mlpack::RStarTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RStarTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:275:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RStarTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:281:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RStarTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RStarTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::RStarTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:251:11: required from ‘void mlpack::RAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::RTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:168:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp: In instantiation of ‘mlpack::RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType>::RectangleTree(MatType&&, size_t, size_t, size_t, size_t, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; SplitType = mlpack::RTreeSplit; DescentType = mlpack::RTreeDescentHeuristic; AuxiliaryInformationType = mlpack::NoAuxiliaryInformation; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
108 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp:108:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; Tree = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:275:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:281:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::RTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::RTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::RTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:251:11: required from ‘void mlpack::RAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:168:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree.hpp:580,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/tree/tree.hpp:19:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp: In instantiation of ‘mlpack::CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::CoverTree(MatType&&, ElemType) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; RootPointPolicy = mlpack::FirstPointIsRoot; ElemType = double]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
239 | dataset(new MatType(std::move(data))),
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/cover_tree/cover_tree_impl.hpp:239:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; Tree = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:275:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:281:14: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::StandardCoverTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::StandardCoverTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::StandardCoverTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:309:13: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:234:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
181 | this->referenceSet = new MatType(std::move(referenceSet));
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:181:26: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, std::vector<unsigned int>&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:316:9: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:234:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
166 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:166:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(Tree*, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; Tree = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:354:14: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:240:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
422 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:422:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:370:14: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:240:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
251 | distancePtr = new arma::mat; // Query indices need to be mapped.
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:251:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
252 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:252:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
256 | neighborPtr = new arma::Mat<size_t>; // All indices need mapping.
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:256:21: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp: In instantiation of ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::KDTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:295:12: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with TreeType = mlpack::KDTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:183:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: warning: ‘new’ of type ‘arma::mat’ {aka ‘arma::Mat<double>’} with extended alignment 16 [-Waligned-new=]
471 | distancePtr = new arma::mat;
| ^~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:471:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: warning: ‘new’ of type ‘arma::Mat<unsigned int>’ with extended alignment 16 [-Waligned-new=]
472 | neighborPtr = new arma::Mat<size_t>;
| ^~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:472:19: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::HRectBound; SplitType = mlpack::MidpointSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::KDTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: warning: ‘new’ of type ‘arma::Mat<double>’ with extended alignment 16 [-Waligned-new=]
138 | dataset(new MatType(std::move(data)))
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:138:13: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:161:36: required from ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Train(MatType) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:309:13: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Train(mlpack::util::Timers&, arma::mat&&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:234:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
27 | return new TreeType(std::forward<MatType>(dataset), oldFromNew);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp: In instantiation of ‘TreeType* mlpack::BuildTree(MatType&&, std::vector<unsigned int>&, const typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type*) [with TreeType = BinarySpaceTree<LMetric<2, true>, RAQueryStat<NearestNS>, arma::Mat<double>, CellBound, UBTreeSplit>; MatType = arma::Mat<double>&; typename std::enable_if<TreeTraits<TreeType>::RearrangesDataset>::type = void]’:
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_impl.hpp:317:38: required from ‘void mlpack::RASearch<SortPolicy, MetricType, MatType, TreeType>::Search(const MatType&, size_t, arma::Mat<unsigned int>&, arma::mat&) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; MatType = arma::Mat<double>; TreeType = mlpack::UBTree; size_t = unsigned int; arma::mat = arma::Mat<double>]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:370:14: required from ‘void mlpack::LeafSizeRAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:240:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/build_tree.hpp:27:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp: In instantiation of ‘void mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::SplitNode(size_t, SplitType<BoundType<MetricType>, MatType>&) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’:
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:142:12: required from ‘mlpack::BinarySpaceTree<MetricType, StatisticType, MatType, BoundType, SplitType>::BinarySpaceTree(MatType&&, size_t) [with MetricType = mlpack::LMetric<2, true>; StatisticType = mlpack::RAQueryStat<mlpack::NearestNS>; MatType = arma::Mat<double>; BoundType = mlpack::CellBound; SplitType = mlpack::UBTreeSplit; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model_impl.hpp:271:33: required from ‘void mlpack::RAWrapper<TreeType>::Search(mlpack::util::Timers&, arma::mat&&, size_t, arma::Mat<unsigned int>&, arma::mat&, size_t) [with TreeType = mlpack::UBTree; arma::mat = arma::Mat<double>; size_t = unsigned int]’
/<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_model.hpp:174:16: required from here
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
906 | left = new BinarySpaceTree(this, begin, splitCol - begin, splitter,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
907 | maxLeafSize);
| ~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:906:10: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: warning: ‘new’ of type ‘mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>’ with extended alignment 16 [-Waligned-new=]
908 | right = new BinarySpaceTree(this, splitCol, begin + count - splitCol,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
909 | splitter, maxLeafSize);
| ~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: uses ‘void* operator new(std::size_t)’, which does not have an alignment parameter
/<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp:908:11: note: use ‘-faligned-new’ to enable C++17 over-aligned new support
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:39:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Distance = int; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/algorithm.hpp:17,
from /<<PKGBUILDDIR>>/src/mlpack/core/std_backport/any.hpp:23,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:96:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>*, std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit> >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > >::CandidateCmp>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Distance = int; _Tp = arma::arma_sort_index_packet<double>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1854 | __final_insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1854:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >; _Distance = int; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry*, std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /usr/include/armadillo:48,
from /<<PKGBUILDDIR>>/src/mlpack/core/arma_extend/arma_extend.hpp:21,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:104:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h: In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::util::Timers::StopAllTimers()’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:177:23:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&>, std::tuple<>}; _Key = std::__cxx11::basic_string<char>; _Val = std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >; _KeyOfValue = std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Stop(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:240:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >]’,
inlined from ‘void mlpack::util::Timers::Start(const std::string&, const std::thread::id&)’ at /<<PKGBUILDDIR>>/src/mlpack/core/util/timers_impl.hpp:214:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::time_point<std::chrono::_V2::system_clock, std::chrono::duration<long long int, std::ratio<1, 1000000000> > > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string<char>; _Tp = std::chrono::duration<long long int, std::ratio<1, 1000000> >; _Compare = std::less<std::__cxx11::basic_string<char> >; _Alloc = std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >]’,
inlined from ‘void mlpack::bindings::cli::EndProgram(mlpack::util::Params&, mlpack::util::Timers&)’ at /<<PKGBUILDDIR>>/src/mlpack/bindings/cli/end_program.hpp:71:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::__cxx11::basic_string<char>, std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > >, std::_Select1st<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > >, std::less<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, std::chrono::duration<long long int, std::ratio<1, 1000000> > > > >::const_iterator’ changed in GCC 7.1
513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
514 | std::tuple<const key_type&>(__k),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
515 | std::tuple<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
In file included from /usr/include/c++/13/string:51,
from /usr/include/c++/13/stdexcept:39,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:34:
/usr/include/c++/13/bits/stl_algobase.h: In function ‘void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >]’:
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:155:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalSplitsNumberSweep<mlpack::RPlusPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>; SplitPolicy = mlpack::RPlusPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepNonLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepNonLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:38:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = mlpack::MinimalCoverageSweep<mlpack::RPlusTreeSplitPolicy>::SweepLeafNode<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >(size_t, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>*, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::ElemType&)::<lambda(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static typename TreeType::ElemType mlpack::MinimalCoverageSweep<SplitPolicy>::SweepLeafNode(size_t, const TreeType*, typename TreeType::ElemType&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>; SplitPolicy = mlpack::RPlusTreeSplitPolicy]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp:105:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Distance = int; _Tp = pair<double, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1897:34,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1931:38:
/usr/include/c++/13/bits/stl_algo.h:91:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
91 | std::iter_swap(__result, __b);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:93:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
93 | std::iter_swap(__result, __c);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:95:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
95 | std::iter_swap(__result, __a);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Distance = int; _Tp = pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1942 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:204:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:309:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:497:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:658:18:
/usr/include/c++/13/bits/stl_algo.h:4894:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
4894 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, vector<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, allocator<pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >; _Compare = bool (*)(const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&, const pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static bool mlpack::XTreeSplit::SplitNonLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:423:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>*, std::vector<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*>, std::allocator<std::pair<double, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>*> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Distance = int; _Tp = pair<arma::Col<long long unsigned int>, unsigned int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:340:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
| ^~~~~~~~~~
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_heap.h:254:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
In function ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1910:25,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/bits/stl_algo.h:1635:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1635 | std::__make_heap(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1911:23,
inlined from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1926:27:
/usr/include/c++/13/bits/stl_heap.h:425:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
425 | std::__pop_heap(__first, __last, __last, __comp);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool mlpack::UBTreeSplit<BoundType, MatType>::SplitNode(BoundType&, MatType&, size_t, size_t, SplitInfo&) [with BoundType = mlpack::CellBound<mlpack::LMetric<2, true> >; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/ub_tree_split_impl.hpp:36:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<arma::Col<long long unsigned int>, unsigned int>*, vector<pair<arma::Col<long long unsigned int>, unsigned int>, allocator<pair<arma::Col<long long unsigned int>, unsigned int> > > >; _Compare = bool (*)(const pair<arma::Col<long long unsigned int>, unsigned int>&, const pair<arma::Col<long long unsigned int>, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool mlpack::UBTreeSplit<BoundType, MatType>::SplitNode(BoundType&, MatType&, size_t, size_t, SplitInfo&) [with BoundType = mlpack::CellBound<mlpack::LMetric<2, true> >; MatType = arma::Mat<double>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/binary_space_tree/ub_tree_split_impl.hpp:36:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<arma::Col<long long unsigned int>, unsigned int>*, std::vector<std::pair<arma::Col<long long unsigned int>, unsigned int>, std::allocator<std::pair<arma::Col<long long unsigned int>, unsigned int> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1918 | __introsort_loop(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_ascend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_ascend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:81:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<arma::arma_sort_index_helper_descend<double> >]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, vector<arma::arma_sort_index_packet<double>, allocator<arma::arma_sort_index_packet<double> > > >; _Compare = arma::arma_sort_index_helper_descend<double>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘bool arma::arma_sort_index_helper(Mat<unsigned int>&, const Proxy<T1>&, uword) [with T1 = Mat<double>; bool sort_stable = false]’ at /usr/include/armadillo_bits/op_sort_index_meat.hpp:96:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<arma::arma_sort_index_packet<double>*, std::vector<arma::arma_sort_index_packet<double>, std::allocator<arma::arma_sort_index_packet<double> > > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::XTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp:57:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static size_t mlpack::RStarTreeSplit::ReinsertPoints(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:59:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)>]’ at /usr/include/c++/13/bits/stl_algo.h:1950:31,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<double, unsigned int>*, vector<pair<double, unsigned int> > >; _Compare = bool (*)(const pair<double, unsigned int>&, const pair<double, unsigned int>&)]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘static void mlpack::RStarTreeSplit::SplitLeafNode(TreeType*, std::vector<bool>&) [with TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp:206:12:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mlpack/base.hpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry&}; _Tp = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry; _Alloc = std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry, std::allocator<mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::DualCoverTreeMapEntry> >::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>&}; _Tp = mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>; _Alloc = std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>, std::allocator<mlpack::CoverTreeMapEntry<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> > >::iterator’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const std::pair<double, unsigned int>&}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, unsigned int> >::iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> > >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::Octree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double> >]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HRectBound, mlpack::MidpointSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::BinarySpaceTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::CellBound, mlpack::UBTreeSplit>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::XTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::XTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::HilbertRTreeSplit<2>, mlpack::HilbertRTreeDescentHeuristic, mlpack::DiscreteHilbertRTreeAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RTreeSplit, mlpack::RTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::CoverTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::FirstPointIsRoot>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int> >; _Compare = mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> >::CandidateCmp]’ at /usr/include/c++/13/bits/stl_queue.h:740:13,
inlined from ‘void mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::InsertNeighbor(size_t, size_t, double) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:818:16,
inlined from ‘double mlpack::RASearchRules<SortPolicy, MetricType, TreeType>::BaseCase(size_t, size_t) [with SortPolicy = mlpack::NearestNS; MetricType = mlpack::LMetric<2, true>; TreeType = mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RStarTreeSplit, mlpack::RStarTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>]’ at /<<PKGBUILDDIR>>/src/mlpack/methods/rann/ra_search_rules_impl.hpp:131:17:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, unsigned int>*, std::vector<std::pair<double, unsigned int> > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
1812 | __insertion_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore*, std::vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore, std::allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation>::SingleTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusPlusTreeSplitPolicy, mlpack::MinimalSplitsNumberSweep>, mlpack::RPlusPlusTreeDescentHeuristic, mlpack::RPlusPlusTreeAuxiliaryInformation> > >::NodeAndScore> > >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore*, vector<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore, allocator<mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation>::DualTreeTraverser<mlpack::RASearchRules<mlpack::NearestNS, mlpack::LMetric<2, true>, mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>, arma::Mat<double>, mlpack::RPlusTreeSplit<mlpack::RPlusTreeSplitPolicy, mlpack::MinimalCoverageSweep>, mlpack::RPlusTreeDescentHeuristic, mlpack::NoAuxiliaryInformation> > >::NodeAndScore&, const mlpack::RectangleTree<mlpack::LMetric<2, true>, mlpack::RAQueryStat<mlpack::NearestNS>